Hipsort — разлика између измена
Садржај обрисан Садржај додат
Ред 219:
== Literatura ==
* {{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 |page=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= }}
* {{Citation |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 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}-
* [http://www.nicollet.net/2009/01/heaps-of-knowledge/ -{Heaps of Knowledge}-]
== Spoljašnje veze ==
* [http://www.sorting-algorithms.com/heap-sort -{Animated Sorting Algorithms: Heap Sort] – graphical demonstration and discussion of heap sort}-
* [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}-]
[[Категорија:Семинарски радови/МАТФ април и мај 2013.]]
| |||