In each selection sort pass, the smallest remaining element is swapped with the element that is:

1. The sorted region grows from the left. 2. The next slot to fill is at its right edge. 3. So the swap uses the leftmost unsorted element. _Source: syllabus Computer Science Class XII, Chapter 5, Sorting._