Timsort (Q942403)
Aller à la navigation
Aller à la recherche
Algorithme de tri
| Langue | Libellé | Description | Également connu comme |
|---|---|---|---|
| français | Timsort |
Algorithme de tri |
|
| anglais | Timsort |
hybrid sorting algorithm based on insertion sort and merge sort |
Déclarations
2002
0 référence
2002
0 référence
2 références
[Timsort] also has good aspects: It's stable (items that compare equal retain their relative order, so, e.g., if you sort first on zip code, and a second time on name, people with the same name still appear in order of increasing zip code; this is important in apps that, e.g., refine the results of queries based on user input). ... It has no bad cases (O(N log N) is worst case; N−1 compares is best). (anglais)
24 février 2011
TimSort is an intriguing sorting algorithm designed in 2002 for Python, whose worst-case complexity was announced, but not proved until our recent preprint. (anglais)
0 référence
0 référence
1 référence
23 février 2020
Identifiants
1 référence
28 octobre 2013