Introsort or introspective sort is a hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance...

performance and optimal worst-case performance. Introselect is related to the introsort sorting algorithm: these are analogous refinements of the basic quickselect...

for example, uses a 3-part hybrid sorting algorithm: introsort is performed first (introsort itself being a hybrid of quicksort and heap sort), to a...

insertion sort, and additional logic), used in Android, Java, and Python, and introsort (quicksort and heapsort), used (in variant forms) in some C++ sort implementations...

required to avoid bad pivot choices and the resultant O(n2) performance. Introsort is a variant of quicksort which solves this problem by switching to heapsort...

well-known comparison sorts include: Quicksort Heapsort Shellsort Merge sort Introsort Insertion sort Selection sort Bubble sort Odd–even sort Cocktail shaker...

complexity. Another example of hybrid algorithms for performance reasons are introsort and introselect, which combine one algorithm for fast average performance...

quicksort, which is fast in practice but has poor worst-case performance, but introsort was introduced to allow both fast average performance and optimal worst-case...

complexity. Heapsort, O ( n log ⁡ n ) {\displaystyle O(n\log n)} , merge sort, introsort, binary tree sort, smoothsort, patience sorting, etc. in the worst case...

Library (STL). In Musser (1997), he developed the sorting algorithm called introsort (also known as introspective sort), and the related selection algorithm...