Multiple choice

Quick sort's worstcase 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

Quick sort's worst-case space complexity is O(n) for recursive implementations when poor pivots create maximum recursion depth, causing stack frames proportional to input size. (Note: optimized implementations using tail recursion or iteration can achieve O(log n)).

Keep practicing — related questions