Timsort (French Wikipedia)
Analysis of information sources in references of the Wikipedia article "Timsort" in French language version.
refsWebsite
Global rank
French rank
43rd place
132nd place
2,232nd place
2,309th place
low place
low place
low place
low place
low place
low place
low place
low place
cnrs.fr
ins2i.cnrs.fr
dagstuhl.de
drops.dagstuhl.de
- « http://drops.dagstuhl.de/opus/volltexte/2018/9467/ » : « TimSort is an intriguing sorting algorithm designed in 2002 for Python, whose worst-case complexity was announced, but not proved until our recent preprint. »
doi.org
dx.doi.org
- (en) Badrish Chandramouli et Jonathan Goldstein, « Patience is a virtue: revisiting merge and sort on modern processors », SIGMOD conference, , p. 731-742 (DOI 10.1145/2588555.2593662).
envisage-project.eu
gnu.org
hg.savannah.gnu.org
- (en) « liboctave/util/oct-sort.cc », sur Dépôt Mercurial d'Octave (consulté le )
googlesource.com
android.googlesource.com
- (en) Android Gingerbread Documentation, « Class: java.util.TimSort<T> », sur Documentation Android (consulté le )
java.net
bugs.openjdk.java.net
- (en) « [#JDK-6804124] (coll) Replace "modified mergesort" in java.util.Arrays.sort with timsort » (consulté le )
key-project.org
- (en) Projet KeY (consulté le )
python.org
mail.python.org
- Tim Peters (d), « http://mail.python.org/pipermail/python-dev/2002-July/026837.html », : « [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). »
bugs.python.org
wikidata.org
- Tim Peters (d), « http://mail.python.org/pipermail/python-dev/2002-July/026837.html », : « [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). »
- (en) Badrish Chandramouli et Jonathan Goldstein, « Patience is a virtue: revisiting merge and sort on modern processors », SIGMOD conference, , p. 731-742 (DOI 10.1145/2588555.2593662).