A simple python program which implements QuickSort Algorithm. Quicksort is a divide and conquer algorithm and is a much more efficient algorithm than the previous algorithms discussed Bubble Sort

Quicksort when implemented well it is one of the best sorting algorithms, In fact, the sort function provided in most of the language libraries is the implementation of Quicksort itself.

Time Complexity of QuickSort:
Best Case O(n log n)
Average Case O(n log n)
Worst Case O(n2)

#python