How does Python's Timsort algorithm work?

Timsort is the sorting algorithm used by Python for sort and sorted. It is a hybrid of merge sort and insertion sort designed to perform well on real-world data with existing order. It is stable, has a worst case time complexity of n log n, and a best case of linear time on already sorted data.