Timsort

Summary

Timsort is a sorting algorithm^[1]. Timsort draws 252 Wikipedia views per month (sorting_algorithm category, ranking #6 of 29).^[2]

Key Facts

• Timsort is credited with the discovery of Tim Peters^[3].
• Timsort's instance of is recorded as sorting algorithm^[4].
• Timsort's instance of is recorded as stable sorting algorithm^[5].
• Timsort's instance of is recorded as comparison sort^[6].
• Timsort's instance of is recorded as hybrid algorithm^[7].
• Timsort's instance of is recorded as adaptive sort^[8].
• Tim Peters is named after Timsort^[9].
• Timsort's based on is recorded as merge sort^[10].
• Timsort's based on is recorded as insertion sort^[11].
• Timsort's time of discovery or invention is recorded as +2002-00-00T00:00:00Z^[12].
• Timsort's publication date is recorded as +2002-00-00T00:00:00Z^[13].
• Timsort's Freebase ID is recorded as /m/076wtj2^[14].
• Timsort's used by is recorded as Python^[15].
• Timsort's used by is recorded as Java Platform, Standard Edition^[16].
• Timsort's used by is recorded as V8^[17].
• Timsort's uses is recorded as array data structure^[18].
• Timsort's worst-case time complexity is recorded as O(n \log(n))^[19].
• Timsort's best-case time complexity is recorded as O(n)^[20].
• Timsort's average time complexity is recorded as O(n \log(n))^[21].
• Timsort's worst-case space complexity is recorded as O(n)^[22].
• Timsort's Microsoft Academic ID is recorded as 64842302^[23].

Body

Designation and Status

Recorded instance of include sorting algorithm^[4], stable sorting algorithm^[5], comparison sort^[6], hybrid algorithm^[7], and adaptive sort^[8].

History and Context

Tim Peters is named after Timsort^[9].

Why It Matters

Timsort draws 252 Wikipedia views per month (sorting_algorithm category, ranking #6 of 29).^[2] Timsort has Wikipedia articles in 10 language editions, a strong signal of global cultural recognition.^[24]