Reference no: EM13893370

Implement the Selection Sort algorithm for sorting an array of n elements. This algorithm has n-1 iterations, each selecting the next largest element a[j] and swapping it with the ele- ment that is in the position where a[j] should be. So on the first iteration it selects the larg- est of all the elements and swaps it with a[n-1], and on the second iteration it selects the largest from the remaining unsorted elements a[0..n-2] and swaps it with a[n-2], etc. On its ith iteration it selects the largest from the remaining unsorted elements a[0..n-i] and swaps it with a[n-i].