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

4 бајта додата ,  пре 4 године
Робот: обликовање ISBN-а
м (sablon cinjenica)
м (Робот: обликовање ISBN-а)
* {{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 |isbn=0-201-89685-0 |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, 2001. ISBN 978-0-262-03293-73. 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}-