Selection sort algorithm

Comparisons done:

Exchanges done:

Legend:
Numbers with this background	- sorted elements
Red numbers	- smallest element found
Numbers with this background	- elements being compared
Black numbers	- unsorted elements

The selection sort algorithm works as follows.

First, find the smallest element in the array.
Second, exchange the found element with the element in the first position.
Then, find the second smallest element (or the smallest element in the rest of the array [not counting the first element]).
Then, exchange the found element with the element in the second position.
Continue in this way until the entire array is sorted.

As you can guess, this method is called selection sort because it works by repeatedly selecting the smallest remaining element.

Let's compare two versions of the selection sort algorithm.