Today we will be discussing Selection Sort! What this algorithm does, is find the smallest element in an unsorted array, and place it at the front . Although, that may sound like it would be a fast way to sort an array, selection sort proves you wrong. The Pseudocode Write a function…