Selection Sort Algorithm

This is the Selection Sort Algorithm.

The idea behind selection sort is to search for the largest element in the list, or in this case the highest test score, move that element to the beginning of the list, and then repeat the same procedure on the remaining portion of the list.

The pseudo-code for this algorithm is as follows:
SelectionSort(A, start, end):
     for (i = start to end)
          min <- i
          for (j = i+1 to end)
               if (A[j] < A[min])
                    min <- j
               end if
          end for

          temp <- A[i]
          A[i] <- A[min]
          A[min] <- temp
     end for
end SelectionSort

Show Work?