Definitions from Wiktionary (smoothsort)
▸ noun: (computing theory) A sorting algorithm based on heapsort but using the Leonardo numbers, tending to perform better than heapsort in cases where the items to be sorted are already partially sorted.
▸ Words similar to smoothsort
▸ Usage examples for smoothsort
▸ Idioms related to smoothsort
▸ Wikipedia articles (New!)
▸ Popular adjectives describing smoothsort
▸ Words that often appear near smoothsort
▸ Rhymes of smoothsort
▸ Invented words related to smoothsort
▸ noun: (computing theory) A sorting algorithm based on heapsort but using the Leonardo numbers, tending to perform better than heapsort in cases where the items to be sorted are already partially sorted.
Similar:
introspective sort,
mergesort,
bucket sort,
selection sort,
cubesort,
cycle sort,
bucketsort,
subsort,
shortlex,
Leonardo number,
more...
▸ Words similar to smoothsort
▸ Usage examples for smoothsort
▸ Idioms related to smoothsort
▸ Wikipedia articles (New!)
▸ Popular adjectives describing smoothsort
▸ Words that often appear near smoothsort
▸ Rhymes of smoothsort
▸ Invented words related to smoothsort