quicsort takes a bit of memory during recursion calls. it depends how many variable you pass in each function and number of variables defined inside the function.so most of the time we don't consider quicksort inplace
In worst case quicksort take O(n) extra space correct me if i am wrong -- Regards Jitendra Kushwaha MNNIT, Allahabad -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
