Multiple choice

Merge sort's worst case Space complexity is

  1. 0

  2. O(n)

  3. O(logn)

  4. None of these
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Merge sort requires O(n) auxiliary space in the worst case because it needs to merge subarrays by copying elements into temporary arrays. The divide-and-conquer approach creates new arrays during the merge phase.

Keep practicing — related questions