introspective sort

Noun

 * 1)  A sorting algorithm that begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted.

Translations

 * German: Introsort
 * Turkish: içgözlemle sıralama