Question: 40
(Choose 1 answer)
Which sorting algorithm has a time complexity of O(n^2) in the worst-case scenario, but can perform better
than both Bubble Sort and Insertion Sort in practice due to its fewer number of swaps?
A. Insertion Sort
B. Bubble Sort
C. Selection Sort
D. Quick Sort
