Which of the following is the correct asymptotic notation for the worst-case…
2025
Which of the following is the correct asymptotic notation for the worst-case time complexity of Merge Sort ?
- A.
O(n)
- B.
O(n log n)
- C.
O(n2)
- D.
O(log n)
Attempted by 133 students.
Show answer & explanation
Correct answer: B
Merge Sort worst-case time complexity is O(n log n).