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)
.
Intuition
References
Expand…
Sorting algoritms in python
https://realpython.com/sorting-algorithms-python/#:~:text=memory%2Dconstrained%20hardware.-,The%20Quicksort%20Algorithm%20in%20Python,resultant%20list%20is%20completely%20sorted.
Sort and Sorted
https://realpython.com/python-sort/