Tim Sort

The fastest current sorting algorithm. Uses a mix of Merge Sort and Insertion Sort.

Process

1. Define the min-size for a run
2. Sort each run using Insertion Sort
3. Merge the runs back together using merge sort.