000			01859cam a22002294a 4500
020			_a0929306325 (alk. paper)
020			_a9780929306322
082	0	0	_a005.133 _bSAH
100	1		_aSahni, Sartaj.
245	1	0	_aData structures, algorithms, and applications in C++
250			_a2nd Edition.
260			_aSummit, NJ : _bSilicon Press, _cc2005.
300			_axxiv, 792, 11 p. : _billustrations ;
500			_aIncluded Index.
505			_aPart I. Preliminaries -- 1. C++ review -- 2. Performance analysis -- 3. Asymptotic notation -- 4. Performance measurement -- Part II. Data structures -- 5. Linear lists: Array representation -- 6. Linear lists: Linked representation -- 7. Arrays and matrices -- 8. Stacks -- 9. Queues -- 10. Skip lists and hashing -- 11. Binary and other trees -- 12. Priority queues -- 13. Tournament trees -- 14. Binary search trees -- 15. Balanced search trees -- 16. Graphs -- Part III. Algorithm-design methods -- 17. The greedy method -- 18. Divide and conquer -- 19. Dynamic programming -- 20. Backtracking (on the Web) -- 21. Branch and bound (on the Web).
520			_aThis text provides students with an introduction to data structures and algorithms. It emphasizes algorithm analysis and the development of efficient code, and includes important background material. Divided into three parts, the text features Data Structure Application sections at the end of each chapter in part two, Algorithm Application sections in each design method chapter in part three, and a gradual development of C++ features not found in C to help students with either a background in C or C++ to comprehend topics in the book.
650		0	_aC++ (Computer program language)
650		0	_aData structures (Computer science)
650		0	_aComputer algorithms.
650		0	_aApplication software
942			_cREF
999			_c11483 _d11483