What is the time complexity of Merge Sort in the worst case ?
2025
What is the time complexity of Merge Sort in the worst case ?
- A.
O(n)
- B.
O(n log n)
- C.
O(n2)
- D.
O(log n)
Attempted by 155 students.
Show answer & explanation
Correct answer: B
Merge Sort worst-case time complexity is O(n log n). It divides the array recursively and merges results, requiring more operations than a single pass.