Which of the following sorting methods will be best if the number of swaps done is the only measure of effeciency?
This sorting algorithms finds the minimum value, swaps it with the value in the first position, and repeats these steps for the remainder of the list.
It does no more than n swaps.