Timsort
A sorting algorithm implemented by Tim Peters in 2001. Timsort is stable and has worst-case time complexity O(n * log n), which is optimal for comparison-based sorting. It has been the sorting method in Python since v2.3.
Last updated: 2023-08-01
Nearby terms:
Time to Live ♦ time zone ♦ Tim Peters ♦ Timsort ♦ TINC ♦ Tinman ♦ tinman+
Try this search on Wikipedia, Wiktionary, Google, OneLook.
Loading
