This article is about one of the popular sorting algorithms - quick sort.
Complexity
Time complexity: O(n log n) in the best case scenario which is much better than bubble or insert sort. In the worst case it’s O(n^2).
Space complexity: O(1).
This article is about one of the popular sorting algorithms - quick sort.
Time complexity: O(n log n) in the best case scenario which is much better than bubble or insert sort. In the worst case it’s O(n^2).
Space complexity: O(1).