Why does QuickSort use O(log(n)) extra space?

Question

I have implemented the below quicksort algorithm. Online I\'ve read that it has a space requirement of O(log(n)). Why is this the case? I\'m not creating any extra data stru

Answer 1

To get rid of the recursive call you would have to use a stack data structure in your code, and it would still occupy log(n) space.