Multiple choice

Merge sort's average case Space complexity is

  1. O

  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 for the temporary arrays used during the merge phase of each recursive call, regardless of time complexity.

Keep practicing — related questions