Red (tip podataka) — разлика између измена

Садржај обрисан Садржај додат
м sablon page
м sitno
Ред 30:
 
== Reference ==
* [[Donald Knuth]]. ''The Art of Computer Programming'', Volume 1: ''Fundamental Algorithms'', Third Edition. Addison-Wesley. {{page|year=1997|isbn=. ISBN 978-0-201-89683-1|pages=}}. Section 2.2.1: Stacks, Queues, and Deques, pp. 238-243.
* [[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=. ISBN 978-0-262-03293-3|pages=}}. Section 10.1: Stacks and queues, pp. 200-204.
* [[William Ford]], [[William Topp]]. ''Data Structures with C++ and STL'', Second Edition. Prentice Hall. {{page|year=2002|isbn=. ISBN 978-0-13-085850-4|pages=}}. Chapter 8: Queues and Priority Queues, pp. 386-390.
* [[Adam Drozdek]]. ''Data Structures and Algorithms in C++'', Third Edition. Thomson Course Technology. {{page|year=2005|isbn=. ISBN 978-0-534-49182-6|pages=}}. Chapter 4: Stacks and Queues, pp. 137-169.
 
== Spoljašnje veze ==