Which description matches the behavior of Selection Sort?

• A. A sort that uses adjacent swaps until sorted.
• B. A sort based on hashing values.
• C. A sort in which each element is sorted one by one and slotted accordingly within a list.
• D. A sort that divides the list into halves recursively.

Answer: (C)

Selection Sort builds the final sorted list from left to right by repeatedly finding the smallest element in the unsorted portion and placing it into its correct position in the sorted portion. In practice, on each pass you pick one element from the remaining unsorted part and move it into the next slot of the already sorted part, so the list gets sorted one element at a time and each element ends up in its proper place as you go. This often involves a single swap per pass into its correct position, and the sorted section grows by one element each time.

Other descriptions don’t fit. A description that uses adjacent swaps until sorted describes bubble-sort behavior, which relies on many neighboring swaps rather than placing elements directly into their final slots. A description based on hashing values isn’t about ordering the entire list. A description that divides the list into halves recursively describes divide-and-conquer sorts like merge sort or quick sort, not selection sort.