The FASTEST sorting algorithm: Part 2 - Binary Insertion Sort

This is the second part of the Tim Sort series. We learn Binary Insertion Sort, an extremely efficient approach to sorting small arrays. In the quest to build chunks and reduce the merge sort tree size, we use the Binary Insertion sort procedure for chunking data. This in turn helps Tim Sort outperform other sorting algorithms.

Tim Sort is the default sorting algorithm for java and python. It's performance is remarkably good compared to naive sorting algorithms. This is because it uses both theoretical optimality and practical considerations when dealing with data (Partially sorted data is taken as one chunk).

The algorithm then merges the chunks using the merge sort algorithm. These algorithms combine to give us the best and fastest sorting algorithm in practice.

References:

Social media links: