Timsort — “The Fastest Sorting Algorithm”

Timsort: A very fast, O(n log n), is a  hybrid stable sorting algorithm.  It was implemented by Tim Peters in 2002 for use in the Python programming language and now used in java Arrays.sort() as well.  Timsort first analyses the list it is trying to sort and then chooses an approach based on the analysis of the list. In the background, it’s basically working by making use of two famous sorting algorithm namely merge sort and insertion sort, in a very optimistic way. Continue reading “Timsort — “The Fastest Sorting Algorithm””