Timsort - When one algorithm isn’t enough #coding #maths

Timsort is a hybrid sorting algorithm that combines the strengths of merge sort and insertion sort. Merge sort excels with large, unsorted data while insertion sort is faster on small or nearly sorted lists. Timsort scans an array for already-ordered sections, cleans them up with insertion sort, then merges those sections together using merge sort — getting the best performance characteristics of both approaches.