Quick Sort

Quick Sort uses Divide and Conquer algorithm approach for its process. This sorting
technique divides the initial unsorted list into two lists, one list elements are
greater than other list's elements. This is attained by using pivot element.
the above process of dividing list into two parts repeats recursively. 
       Quick sort works well in larger lists than any other sorting process.