Question

Which sorting algorithm involves repeatedly selecting the smallest element and placing it in its correct position?

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

Hint:

Keyword clue:
“Selecting the smallest element” \(\rightarrow\) Selection Sort.
“Swapping adjacent elements” \(\rightarrow\) Bubble Sort.
“Inserting into sorted sequence” \(\rightarrow\) Insertion Sort.

Answer 1

The Correct Option is B

Concept:
Sorting algorithms are classified by their internal mechanisms for ordering elements.
Selection Sort specifically works by partitioning the array into two sublists: a sorted sublist at the left and an unsorted sublist at the right.

Step 1: Mechanism of Selection Sort:
In Selection Sort, the algorithm continuously scans the unsorted segment of the array to locate the minimum (smallest) element.
Once the smallest element is identified, it is swapped with the first unsorted element, thereby appending it to the sorted segment.
This process of finding the smallest remaining element and placing it into its designated index repeats for each position in the list.

Step 2: Comparison with Other Algorithms:
- Bubble sort repeatedly swaps adjacent out-of-order pairs to float the largest value to the end.
- Insertion sort takes one element from the unsorted part and inserts it into its correct relative position within the already sorted part.
- Quick sort partitions the list around a pivot element.
Final Answer:
Selection Sort is precisely defined by repeatedly selecting the minimum element and placing it in position. Hence, option (B) is correct.