Question:medium

Which sorting algorithm has the same time complexity for all the cases-best, average, worst?

Show Hint

Merge Sort: \[ O(n\log n) \] for Best, Average and Worst cases.
Updated On: Jun 25, 2026
  • Bubble Sort
  • Quick Sort
  • Radix Sort
  • Merge Sort
Show Solution

The Correct Option is D

Solution and Explanation

Was this answer helpful?
0