Multiple choice

Merge sort's worst-case time complexity is

  1. O(n2)

  2. O(nlogn)

  3. O(logn)

  4. O(n)
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Merge sort guarantees O(n log n) time complexity in all cases, including the worst case, because the splitting and merging steps are always balanced.

Keep practicing — related questions