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

235 бајтова уклоњено ,  пре 3 године
ciscenje mrtvih referenci
(Спашавам 1 извора и означавам 0 мртвим. #IABot (v2.0beta10ehf1))
м (ciscenje mrtvih referenci)
* {{Citation |first=Miodrag |last=Živković |title=Algoritmi | pages=96-101 |url = http://poincare.matf.bg.ac.rs/~ezivkovm/nastava/algoritmi.pdf}}
* {{Citation |first=J. W. J. |last=Williams |title=Algorithm 232 - Heapsort |year=1964 |journal=Communications of the ACM |volume=7 |issue=6 |pages=347–348 |doi= }}
* {{Citation |first=Robert W. |last=Floyd |title=Algorithm 245 - Treesort 3 |year=1964 |journal=Communications of the ACM |volume=7 |issue=12 |pagepages=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 |isbn=0-201-89685-0 |pages=144–155 |contribution=§5.2.3, Sorting by Selection}}
== Spoljašnje veze ==
* [https://www.toptal.com/developers/sorting-algorithms-{Animated Sorting Algorithms: Heap Sort]{{Мртва веза|date=09. 2018 |bot=InternetArchiveBot |fix-attempted=yes }} – graphical demonstration and discussion of heap sort}-
* [https://web.archive.org/web/20130326084250/http://olli.informatik.uni-oldenburg.de/heapsort_SALA/english/start.html -{Courseware on Heapsort from Univ. Oldenburg] - With text, animations and interactive exercises}-
* [http://www.nist.gov/dads/HTML/heapSort.html -{NIST's Dictionary of Algorithms and Data Structures: Heapsort}-]