Which sorting algorithm repeatedly selects the smallest element and places it in the correct position?
A
Merge Sort
B
Quick Sort
C
Selection Sort
D
Heap Sort
Correct Answer: Option C — Selection Sort
Explanation:
Selection Sort repeatedly finds the minimum element from the unsorted portion and places it at the beginning. It is simple but inefficient f...
Selection Sort repeatedly finds the minimum element from the unsorted portion and places it at the beginning. It is simple but inefficient for large datasets.