Which sorting algorithm sorts by repeatedly selecting the smallest remaining element and placing it into its final position?

• A. Bubble Sort
• B. Selection Sort
• C. Insertion Sort
• D. Merge Sort

Answer: (B)

Selection sort works by repeatedly finding the smallest element in the portion of the list that hasn’t been sorted yet and swapping it into the next position of the sorted portion. With each pass, one more element is placed in its final spot, starting from the front, until the entire list is sorted. This direct action of selecting the minimum and moving it to its rightful place is what distinguishes this approach.

This differs from other common sorts: bubble sort moves larger elements upward by swapping adjacent pairs, not by selecting a minimum; insertion sort builds the sorted section by inserting each new element into its correct place within what’s already sorted; and merge sort splits the list and then merges sorted halves, rather than repeatedly selecting a minimum and placing it in front.