Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
Adaptive heap sortAdaptive sortArray data structureBinary heap

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
O Algoritmo de Ordenação Smoothsort explicado
We present the sorting algorithm Smoothsort [1] [2], developed by Dijkstra in 1981 which, inexplicably, is not mentioned in the… 
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… 
1991
1991
Smoothsort Revisited
Highly Cited
1989
Highly Cited
1989
Load Balancing , Selection and Sorting on the HypercubeC
This paper presents novel load balancing, selection and sorting algorithms for the hypercube with 1-port communication. The main… 
1987
1987
Rigorous derivation of a sophisticated algorithm: smoothsort
1982
1982
An Introduction to Three Algorithms for Sorting in Situ
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)