Multiple choice

Quick 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
C Correct answer
Explanation

Quick sort requires stack space for recursive function calls. On average, the recursion tree depth is logarithmic, leading to an average case space complexity of O(logn).

Keep practicing — related questions