Editing Heapsort (section)

== References ==
* {{Cite journal |first=J. W. J. |last=Williams |author-link=J. W. J. Williams |title=Algorithm 232 – Heapsort |year=1964 |journal=[[Communications of the ACM]] |volume=7 |issue=6 |pages=347–348 |doi=10.1145/512274.512284}}
* {{Cite journal |first=Robert W. |last=Floyd |author-link=Robert W. Floyd |title=Algorithm 245 – Treesort 3 |year=1964 |journal=[[Communications of the ACM]] |volume=7 |issue=12 |page=701 |doi= 10.1145/355588.365103 |s2cid=52864987|doi-access=free }}
* {{Cite journal |first=Svante |last=Carlsson |author-link=:sv:Svante Carlsson |title=Average-case results on heapsort |year=1987 |journal=[[BIT Numerical Mathematics]] |volume=27 |issue=1 |pages=2–17 |doi= 10.1007/bf01937350 |s2cid=31450060}}
* {{Cite book |first=Donald |last=Knuth |author-link=Donald Knuth |title=[[The Art of Computer Programming]] |volume=3: Sorting and Searching |edition=3rd |publisher=Addison-Wesley |year=1997 |isbn=978-0-201-89685-5 |pages=144–155 |chapter=§5.2.3, Sorting by Selection }}
* {{Cite book |last1=Cormen |first1=Thomas H. |author-link1=Thomas H. Cormen |last2=Leiserson |first2=Charles E. |author-link2=Charles E. Leiserson |last3=Rivest |first3=Ronald L. |author-link3=Ron Rivest |last4=Stein |first4=Clifford |author-link4=Clifford Stein |year=2001 |title=[[Introduction to Algorithms]] |edition=2nd |publisher=MIT Press and McGraw-Hill |isbn=0-262-03293-7}} Chapters 6 and 7 Respectively: Heapsort and Priority Queues
* [http://www.cs.utexas.edu/users/EWD/ewd07xx/EWD796a.PDF A PDF of Dijkstra's original paper on Smoothsort]
* [http://cis.stvincent.edu/html/tutorials/swd/heaps/heaps.html Heaps and Heapsort Tutorial] by David Carlson, St. Vincent College