The programmer was trying to implement the following algorithm in python For each position, i, of the elements we are given
1.1 Locate the position of the smallest item in the array at an index greater than or equal to i. Call this position index_of_min_item
1.2 Swap the elements at position i and index_of_min_item
An Example Of The Algorithm
Let's says we were given the following values: 12, 45, 10, 8, 13
Iteration 0
Index 0 1 2 3 4
Value 12 45 10 8 13
i = 0 so we find the minimum value at index >= 0 which is 8 at index 3. Swap what is at index 0 and index 3.
Index 0 1 2 3 4
Value 8 45 10 12 13
Iteration 1
Index 0 1 2 3 4
Value 8 45 10 12 13
i = 1 so we find the minimum value at index >= 1 which is 10 at index 2. Swap what is at index 1 and index 2.
Index 0 1 2 3 4
Value 8 10 45 12 13
Iteration 2
Index 0 1 2 3 4
Value 8 10 45 12 13
i = 2 so we find the minimum value at index >= 2 which is 12 at index 3. Swap what is at index 2 and index 3.
Index 0 1 2 3 4
Value 8 10 12 45 13
Iteration 3
Index 0 1 2 3 4
Value 8 10 12 45 13
i = 3 so we find the minimum value at index >= 3 which is 13 at index 4. Swap what is at index 3 and index 4.
Index 0 1 2 3 4
Value 8 10 12 13 45
Iteration 4
Index 0 1 2 3 4
Value 8 10 12 13 45
i = 43 so we find the minimum value at index >= 4 which is 45 at index 4. Swap what is at index 4 and index 4.
Index 0 1 2 3 4
Value 8 10 12 13 45
Completion
At this point, we are done and the values are sorted