000			01411nam a22002417a 4500
005			20260908162445.0
008			260908s2014 |||||||| |||| 00| 0 eng d
020			_a9780273769385
040			_cPK-LaUMT
082			_aT 005.13 _bWEI-D
100	1		_aWeiss, Mark Allen _92726
245	1	0	_aData structures and algorithm analysis in C++ / _cMark Allen Weiss
250			_a4th ed.
260			_aHarlow : _bPearson Education, _c2014
300			_a653 p.
500			_aIndex present
520			_aThis is an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis courses. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs using the C++ programming language. This book explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss careful, rigorous and in-depth analysis of each type of algorithm
546			_aEng
650			_aC++ (Computer program language) _94828
650			_aData structures (Computer science) _93597
650			_aComputer algorithms _93596
942			_cBK
999			_c142460 _d142460