000			01848nam a2200241 4500
001			vtls001890960
003			MY-SjTCS
005			20200226121330.0
008			110218t2000 mau 001 eng
020			_a0201612445
039		9	_a201909131539 _bummi _c201102181310 _dVLOAD _y200407271915 _zVLOAD
082	0	4	_a519.7 _bBAA
100	1		_aBaase, Sara. _97462
245	1	0	_aComputer algorithms : _bintroduction to design and analysis / _cSara Baase, Allen Van Gelder
250			_a3rd ed.
260			_aReading, Mass. : _bAddison-Wesley, _cc2000
300			_axix, 688 p. ; _c25 cm.
505	0		_aPreface. - 1. Analyzing Algorithms and Problems : Principles and Examples. - 2. Data Abstraction and Basic Data Structures. - 3. Recursion and Induction. - 4. Sorting. - 5. Selection and Adversary Arguments. - 6. Dynamic Sets and Searching. - 7. Graphs and Graph Traversals. - 8. Graph Optimization Problems and Greedy Algorithms. - 9. Transitive Closure, All-Pairs Shortest Paths. - 10. Dynamic Programming. - 11. String Matching. - 12. Polynomials and Matrices. - 13. NP-Complete Problems. - 14. Parallel Algorithms. - A. Java Examples and Techniques. - Bibliography. - Index.
520			_aThis book is intended for an upper-division or graduate course in algorithms. It has sufficient material to allow several choices of topics. The purpose of the book is threefold. It is intended to teach algorithms for solving real problems that arise frequently in computer applications, to teach basic principles and techniques of computational complexity (worst-case and average behaviour, space usage, and lower bounds on the complexity of a problem), and to introduce the areas of NP-completeness and parallel algorithms. - Preface
650		0	_aComputer algorithms. _95494
700	2		_aVan Gelder, Allen. _e(j.a) _9102792
920			_aUOSC : 560433
999			_c180945 _d180945