https://en.wikipedia.org/wiki/Timsort Timsort - Wikipedia From Wikipedia, the free encyclopedia Hybrid sorting algorithm based on insertion sort and merge sort Timsort is a hybrid, stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. It w en.wikipedia.org Timsort Peter McIlroy의 1993년 논문인 [Optimistic Sorting and Informati..