Quick Sort

• Uses divide and conquer strategy.
• Recursive algorithm.
• The merge step does nothing.

In practice Quick Sort outperforms Merge Sort, Insertion Sort and Selection Sort.

Partition

1. Arrange the elements smaller than pivot to its left.
2. Then arrange the elements bigger than the pivot to its right.
3. The elements don’t have to be in order. Just to the correct side of the pivot.

Recursively call the divide step until the sub-arrays less than 2 elements long.