| 1 | // time O(n^2) worst case |
| 2 | // time O(n log n) best and Avg case |
| 3 | // space O(log n) because we need to use recursion and if we apply quick sort first on the smaller array that |
| 4 | // way we know that at most we will store log n calls on the call stack |
nothing calls this directly
no test coverage detected