000			01699nam a2200241Ia 4500
003			NULRC
005			20250520100608.0
008			250520s9999 xx 000 0 und d
020			_a9780132316811
040			_cNULRC
050			_aQA 76.9.A43 .L48 2012
100			_aLevitin, Anany. _eauthor
245		0	_aIntroduction to the design and analysis of algorithms / _cAnany Levitin.
250			_aThird edition.
260			_aBoston, Massachusetts : _bPearson, _cc2012
300			_axxiv, 565 pages : _billustrations ; _c23 cm.
365			_bUSD103.26
504			_aIncludes bibliographical references and index.
505			_aFundamentals of the analysis of algorithm efficiency -- Brute force and exhaustive search -- Decrease-and-conquer -- Divide-and-conquer -- Transform-and-conquer -- Space and time trade-offs -- Dynamic programming -- Greedy technique -- Iterative improvement -- Limitations of algorithm power -- Coping with the limitations of algorithm power.
520			_aBased on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
650			_aCOMPUTER ALGORITHMS
942			_2lcc _cBK
999			_c8988 _d8988