I've searched on internet and everybody said it's stack space needed on recursion. I know log(n) extra space for quick sort happened when use in place, but still I don't get it. Anybody can explain intuitively why quick sort need log(n) extra space and mergesort need n? Thanks.
Can anybody explain intuitively why quick sort need log(n) extra space and mergesort need n?
algorithm analysis;sorting;space analysis