tag

#smoothsort

2 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Smoothsort

Smoothsort Smoothsort is an adaptive comparison-based sorting algorithm designed by Edsger Dijkstra. It is related to heapsort, but it uses a forest of Leonardo heaps instead of one binary heap. The main advantage is adaptivity. Smoothsort runs in linear time on already sorted or nearly sorted data, while preserving the same worst-case bound as heapsort. Problem Given a sequence $A$ of length $n$, reorder it such that $$ A[0] \le...

Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Smoothsort Adaptive Heap Sort

Smoothsort Adaptive Heap Sort Smoothsort is an adaptive heap-based sorting algorithm. It preserves the in-place and worst-case guarantees of heapsort, but it performs much less work when the input is already close to sorted. You use it when constant extra space matters and the input may contain existing order. Problem Given an array ( A ) of length ( n ), sort it in place while taking advantage of nearly...