Understanding Quick Sort

Quick Sort is a divide and conquer algorithm. It works by selecting an element in the array as a Pivot and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the Pivot. The sub-arrays are then...