Quick Sort Algorithm:Explanation with Example
QuickSort uses Divide and Conquer algorithm. It pick any element as pivot and partitions the given array around the picked pivot element. There are many different versions of quickSort that pick pivot in different ways.
1.Always pick first element as pivot.
2.Always pick last element as pivot (implemented below)
3.Pick a random element as pivot.
Depending upon the element picked up, the order of list elements will vary.
![Real Big Boss [Alchemist] Hard Carry Machine Farming Max Slow Build Enemy Can't Run Dota2 7.34b](https://images.videosashka.com/watch/zmSK_4zB_d8)
