出典:Wiktionary
Tim + sort, named after Tim Peters, who implemented it in 2002 for the Python programming language.
Timsort
出典:Wikipedia
出典:『Wikipedia』 (2011/06/02 17:17 UTC 版)
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 was invented by Tim Peters in 2002 for use in the Python programming language, and has been Python's standard sorting algorithm since version 2.3. It is now also used to sort arrays in Java SE 7, and on the Android platform.