Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Smoothsort
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==External links== * [https://www.enterag.ch/hartwig/order/smoothsort.pdf Commented transcription of EWD796a, 16-Aug-1981] * [https://www.keithschwarz.com/smoothsort/ Detailed modern explanation of Smoothsort] * [[wikibooks:Algorithm Implementation/Sorting/Smoothsort]] * [https://github.com/Morwenn/poplar-heap Description and example implementation of Poplar heap] * {{cite journal |title=On the Nested Heap Structure in Smoothsort |journal={{Nihongo|Mathematical Foundations of Computer Science and Their Applications|ζ°η解ζη η©Άζθ¬η©Άι²|lead=yes}} |last1=Noshita |first1=Kohei |last2=Nakatani |first2=Yoshinobu |date=April 1985 |volume=556 |pages=1–16 |hdl=2433/98975 |language=en |url=http://hdl.handle.net/2433/98975 }} {{sorting}} [[Category:Comparison sorts]] [[Category:Heaps (data structures)]] [[Category:Edsger W. Dijkstra]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)