Quick sort in python

Quicksort is a very efficient sorting algorithm invented by C.A.R. Hoare. It uses divide and conquer to gain the same advantages as the merge sort, while not using additional storage. As a trade-off, however, it is possible that the list may not be divided in half. Here is the exmaple of Quick sort in python.

https://www.geekboots.com/python/quick-sort

Comments