I have read that recursive implementation of QuickSort will require O(log n) of additional space. Why would that be?
Is that due to stack space?
I have read that recursive implementation of QuickSort will require O(log n) of additional
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have read that recursive implementation of QuickSort will require O(log n) of additional space. Why would that be?
Is that due to stack space?
Yes indeed that would be down to the stack space for the recursive calls.