مرتبسازی تیم
Sign in to saveTimsort is a hybrid, stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. 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 (runs) and uses them to sort the remainder more efficiently. This is done by merging runs until certain criteria are fulfilled. Timsort was Python's standard sorting algorithm from version 2.3 until it was replaced in 3.11 by Powersort, a derived algorithm with a more robust merge policy. Timso
Key facts
- Algorithm.class
- Sorting algorithm
- Algorithm.caption
- A visual representation of Timsort
- Algorithm.data
- Array
- Algorithm.time
- O(n\log n)
- Algorithm.best time
- O(n)
- Algorithm.average time
- O(n\log n)
- Algorithm.space
- O(n)
- Algorithm.optimal
- No; Powersort and Peeksort are closer to optimal
via Wikipedia infobox
Wikidata facts
- Instance of
- adaptive sort
- Based on
- insertion sort
Show 4 more facts
- used by
- V8
- publication date
- 2002-00-00
- time of discovery or invention
- 2002-00-00
via Wikidata · CC0