Introsort
Introsort Introsort or introspective sort is a sorting algorithm ... 3 killer sequence of 100,000 elements, introsort's running time was 1/200th that ... implementation of unstable sort uses the Musser introsort approach with the recursion depth to switch ...
http://en.wikipedia.org/wiki/Introsort - 3k - Cached - Similar pages

Introsort   (translated from German)
Introsort Introsort is in Sort algorithm. It is a ... n log n)-Worst-Case. Admits became Introsort above all by the fact that Silicone ... LIBRARY for C++ for some years to Introsort instead of Quicksort falls back. In the meantime Introsort was transferred also to other implementations ...
http://de.wikipedia.org/wiki/Introsort - 2k - Cached (German) - Wikipedia (German) - Similar pages

Talk:Quicksort
... covered. I also extracted some of the introsort discussion to an article on introsort, not because it was too long but because I'd like to see introsort expanded in the future and it wasn ...
http://en.wikipedia.org/wiki/Talk:Quicksort - 69k - Cached - Similar pages

Quicksort
... widely used is introspective sort, often called introsort. This starts with quicksort and switches to ... of worst case performance except in the introsort variant. If it's known in advance ... directly will be faster than waiting for introsort to switch to it. Heapsort also has ...
http://en.wikipedia.org/wiki/Quicksort - 54k - Cached - Similar pages

Tri rapid   (translated from French)
... to use an iterative sorting can consider introsort or it tri by heap . A simple ... the tri rapid become largely used is introsort alias introspective leaves Musser 1997 . It starts ...
http://fr.wikipedia.org/wiki/Tri_rapide - 23k - Cached (French) - Wikipedia (French) - Similar pages

Sorting procedure   (translated from German)
... n 2 /2~n 2 /2 yes - Introsort O(n·log(n)) O(n·log(n)) O ...
http://de.wikipedia.org/wiki/Sortierverfahren - 14k - Cached (German) - Wikipedia (German) - Similar pages

Quicksort   (translated from German)
Quicksort QuickSort (of engl. quick - fast, ton of sort - sort) is faster, rekursiver , nonmore stably Sort algorithm, that according to the principle Parts and prevail (English Divide and more conquer) works. It became 1960 of C. Antony R. Hoare in his basic form invented and since then of many researchers develops ...
http://de.wikipedia.org/wiki/Quicksort - 21k - Cached (German) - Wikipedia (German) - Similar pages

List of algorithms   (translated from German)
... Combsort COUNTING place Heapsort INSERT ion place Introsort: Improved Quicksort algorithm, which n) also ...
http://de.wikipedia.org/wiki/Liste_von_Algorithmen - 9k - Cached (German) - Wikipedia (German) - Similar pages

List of terms relating to algorithms and data structures
... search interpolation sort intersection interval tree intractable introsort introspective sort inverse Ackermann function inverted file ...
http://en.wikipedia.org/wiki/List_of_terms_relating_to_algorithms_and_data_structures - 48k - Cached - Similar pages

Category:Sort algorithms
... Heapsort I Insertion sort Insertion sort implementations Introsort J J sort M Merge sort O ...
http://en.wikipedia.org/wiki/Category:Sort_algorithms - 2k - Cached - Similar pages