000			00883nam a22001457a 4500
999			_c6412 _d6412
008			201203b ||||| |||| 00| 0 eng d
020			_a978-93-325-8548-5
082			_223 _a004 _bLEV
100			_aLevitin Anany
245			_aIntroduction to The Design and Analysis of Algorithms _cAnany Levitin _hEnglish
260			_aIndia _bPearson _c2017
300			_a589p. ; _bSoft Bound _c18*23 cm
505			_aPreface 1. Introduction 2. Fundamentals of the Analysis of Algorithm Efficiency 3. Brute Force 4. Divide-and-Conquer 5. Decrease-and-Conquer 6. Transform-and-Conquer 7. Space and Time Tradeoffs 8. Dynamic Programming 9. Greedy Technique 10. Limitations of Algorithm Power 11. Coping with the Limitations of Algorithm Power Appendix A: Useful Formulas for the Analysis of Algorithms Appendix B: Short Tutorial on Recurrence Relations Bibliography Index
942			_2ddc _cBK