Multiple choice

Merge sort's average 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 is a divide and conquer algorithm that requires auxiliary space proportional to the number of elements being sorted, resulting in O(n) space complexity.

Keep practicing — related questions