Which sorting algorithm moves the smallest (or largest) unsorted element to its proper position in each pass?

Selection Sort is the algorithm that operates by moving the smallest (or largest) unsorted element to its proper position in each pass. The way this algorithm works is by iterating through the unsorted portion of the list and selecting the minimum (or maximum) value. Once that value is identified, it is swapped with the first unsorted element, effectively placing it in its sorted position. This process is repeated for each subsequent element until the entire list is sorted.

This characteristic of Selection Sort is what sets it apart from the other algorithms listed. For instance, Bubble Sort repeatedly steps through the list, comparing adjacent elements and swapping them if they are in the wrong order, which does not involve selecting a single smallest or largest element each time. Insertion Sort builds a sorted sequence by taking elements from the unsorted part and placing them into the correct position within the sorted part, rather than systematically selecting the smallest first. Quick Sort, on the other hand, uses a divide-and-conquer strategy that involves selecting a pivot and partitioning the array, but it does not specifically ensure that the smallest or largest unsorted element is placed in order during each iteration.

Thus, Selection Sort's method of consistently moving the smallest (or largest) unsorted element to