Timsort [SEP] based on
Timsort
Timsort is a hybrid sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. It uses techniques from Peter McIlroy's "Optimistic Sorting and Information Theoretic Complexity", in "Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms", pp. 467–474, January 1993. It was implemented by Tim Peters in 2002 for use in the Python programming language. The algorithm finds subsequences of the data that are already ordered, and uses
Tim Peters (software engineer)
Tim Peters is an American software developer who created the Timsort hybrid sorting algorithm, was a major contributor to the Python programming language and its original CPython implementation, and is prominent in the Python community. A pre-1.0 CPython user, he was among the group of early adopters who contributed to the detailed design of the language in its early stages. He later created the Timsort algorithm (based on earlier work on the use of "galloping" search) which has been used in Python since version