Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,033,960 papers from all fields of science
Search
Sign In
Create Free Account
Smoothsort
Known as:
Smooth
In computer science, smoothsort is a comparison-based sorting algorithm. A variant of heapsort, it was invented and published by Edsger Dijkstra in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Adaptive heap sort
Adaptive sort
Array data structure
Binary heap
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2002
2002
EWD: making it simple is not easy
F. Sullivan
Computing in science & engineering (Print)
2002
Corpus ID: 8984467
rigorous form. The final expression of the algorithm usually contained a proof of its correctness. Dijkstra’s notes, the bulk of…
Expand
1987
1987
Rigorous derivation of a sophisticated algorithm: smoothsort
U. Furbach
,
L. Schmitz
1987
Corpus ID: 118734987