smoothsort
Sign in to saveIn computer science, smoothsort is a comparison-based sorting algorithm. A variant of heapsort, it was invented and published by Edsger Dijkstra in 1981. Like heapsort, smoothsort is an in-place algorithm with an upper bound of operations (see big O notation). Like heapsort, smoothsort is not a stable sort. The advantage of smoothsort is that it comes closer to time if the input is already sorted to some degree, whereas heapsort averages regardless of the initial sorted state.
In the Vinony graph
Within Vinony's link graph, smoothsort is referenced by 67 other articles, and connects out to Edsger W. Dijkstra, sorting algorithm and Japanese.
Vinony files it under Comparison sorts, Edsger W. Dijkstra and Heaps (data structures).
Its subject is documented across 10 Wikipedia language editions.
Key facts
- Algorithm.name
- Smoothsort
- Algorithm.class
- Sorting algorithm
- Algorithm.image
- |alt=An animation depicting smoothsort's operation, showing the heap being built and then disassembled,
- Algorithm.caption
- Smoothsort operating on an array which is mostly in order. The bars across the top show the tree structure.
- Algorithm.data
- Array
- Algorithm.space
- total, auxiliary
- Algorithm.optimal
- When the data is already sorted
via Wikipedia infobox
Wikidata facts
- Instance of
- sorting algorithm
- Based on
- heapsort
- Image
- Smoothsort.gif
Show 3 more facts
- discoverer or inventor
- Edsger W. Dijkstra
- time of discovery or invention
- 1981-00-00
Sources (1)
via Wikidata · CC0