More Sorting Flashcards
1
Q
What is quicksort space complexity and why?
A
O(logn). Because while it’s in place, it still calls itself recursively which uses O(logn) space on the stack
-
Key Links
-
Subjects
-
Company
-
Find Us
-
What is quicksort space complexity and why?
O(logn). Because while it’s in place, it still calls itself recursively which uses O(logn) space on the stack
Key Links
Subjects
Company
Find Us
