Python3

Assume that the array A = [5, 1, 12, -5, 16, 2, 12, 14] needs to be sorted in ascending order.

Originally, the entire array is unsorted. You need to find the minimum element in the entire array.

The minimum element in the array i.e. -5 is searched for and then swapped with the element that is currently located at the first position, i.e. 75.

Now the array has two parts: sorted (in green) and unsorted (in red).

Now the new minimum element in the remaining unsorted (red) array is searched for and put in the second position, and so on.

5 1 12 -5 16 2 12 14 5 1 12 -5 16 2 12 14 5 1 12 5 16 2 12 14 5 1 12 5 16 2 12 14 -5 1 2 5 16 12 12 14 5 12 5 16 12 12 14 -5 1 2 5 12 16 12 14 -5 1 2 5 12 12 16 14 5 1 2 5 12 12 14 16