Quick Sort

An efficient, divide-and-conquer sorting algorithm. It works by selecting a "pivot" element and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.