Definitions from Wiktionary (introspective sort)
▸ 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.
▸ Words similar to introspective sort
▸ Usage examples for introspective sort
▸ Idioms related to introspective sort
▸ Wikipedia articles (New!)
▸ Words that often appear near introspective sort
▸ Rhymes of introspective sort
▸ Invented words related to introspective sort
▸ 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.
Similar:
selection sort,
bucket sort,
smoothsort,
cycle sort,
subsort,
mergesort,
cubesort,
bucketsort,
counting sort,
radix sort,
more...
Opposite:
▸ Words similar to introspective sort
▸ Usage examples for introspective sort
▸ Idioms related to introspective sort
▸ Wikipedia articles (New!)
▸ Words that often appear near introspective sort
▸ Rhymes of introspective sort
▸ Invented words related to introspective sort