e/Timsort

Information
has gloss	eng: 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 .
lexicalization	eng: timsort
instance of	(noun) an algorithm for sorting a list sorting algorithm

Media
media:img	Timsort-edited.png