000			01434nam a2200241Ia 4500
003			NULRC
005			20250520100607.0
008			250520s9999 xx 000 0 und d
020			_a9788120345751
040			_cNULRC
050			_aQA 76.9.A43 .M64 2012
100			_aMohan, I. Chandra. _eauthor
245		0	_aDesign and analysis of algorithms / _cI. Chandra Mohan.
250			_aSecond edition.
260			_aNew Delhi, India : _bPHI Learning Private Limited, _cc2012
300			_axiii, 186 pages : _billustrations ; _c24 cm.
365			_bUSD27.33
504			_aIncludes index.
505			_a1, Fundamentals -- 2. Divide-and-Conquer Methods -- 3. The Greedy Method -- 4. Set Manipulation Algorithms -- 5. Dynamic Programming -- 6. Search and Traversal Techniques -- 7. Backtracking Methods -- 8. Branch-and-Bound Methods -- 9. Algebraic Simplification and Transformation -- 10. Lower Boundary Theory and NP-Hard and NP-Complete Problems -- References -- Index.
520			_aThis book, on Design and Analysis of Algorithms, in its second edition, presents a detailed coverage of the time complexity of algorithms. In this edition, a number of chapters have been modified and updated with new materials. It discusses the various design factors that make one algorithm more efficient than others, and explains how to devise the new algorithms or modify the existing ones.
650			_aCOMPUTER ALGORITHMS
942			_2lcc _cBK
999			_c8952 _d8952