Hipsort — разлика између измена

3 бајта уклоњена ,  пре 2 године
pretvaranje sablona page u cite book
м (Бот: обликујем ISBN; козметичке измене)
м (pretvaranje sablona page u cite book)
* {{Citation |first=Robert W. |last=Floyd |title=Algorithm 245 - Treesort 3 |year=1964 |journal=Communications of the ACM |volume=7 |issue=12 |pages=701 |doi= }}
* {{Citation |first=Svante |last=Carlsson |title=Average-case results on heapsort |year=1987 |journal=BIT |volume=27 |issue=1 |pages=2-17 |doi= }}
* {{Cite book|ref=harv |first=Donald |last=Knuth |series=The Art of Computer Programming |volume=3 |title=Sorting and Searching |edition=third |publisher=Addison-Wesley |year=1997 |idisbn=ISBN 978-0-201-89685-5 |pages=144-155 |contribution=§5.2.3, Sorting by Selection}}
* Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. ''Introduction to Algorithms'', Second Edition. MIT Press and McGraw-Hill. {{page|year=2001|isbn=978-0-262-03293-3|pages=}}. 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}-]