Open g-patel opened 7 years ago
Quicksort worst case space complexity O(log n)? I think it should be O(n) for naive quicksort, and O(log n) for optimized versions like using tail calls.
Quicksort worst case space complexity O(log n)? I think it should be O(n) for naive quicksort, and O(log n) for optimized versions like using tail calls.