|
|
Definition of Introspective sort
1. Noun. (computing) 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. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Introspective Sort
Other Resources:
