Which of the following sorting algorithms has the best time complexity in the…
2025
Which of the following sorting algorithms has the best time complexity in the worst case ?
- A.
Quick Sort
- B.
Merge Sort
- C.
Bubble Sort
- D.
Selection Sort
Attempted by 114 students.
Show answer & explanation
Correct answer: B
Merge Sort has the best worst-case time complexity of O(n log n) among common sorting algorithms. Quick Sort, Bubble Sort, and Selection Sort all have O(n^2) worst-case complexity.