English

Noun

smoothsort ‎(uncountable)

1. (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.