introspective sort
Jump to navigation
Jump to search
English[edit]
Noun[edit]
introspective sort (plural introspective sorts)
- (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.
Synonyms[edit]
Translations[edit]
Translations
|