Comparison with Merge Sort
With quick sort, there is no need to use the auxiliary array that we used in the merge sort approach. This reduces the space complexity
and choosing a random pivot from array improves the time complexity
as well.
With quick sort, there is no need to use the auxiliary array that we used in the merge sort approach. This reduces the space complexity
and choosing a random pivot from array improves the time complexity
as well.