000 | 01033cam a22002294a 4500 | ||
---|---|---|---|
001 | 14171296 | ||
003 | OSt | ||
005 | 20191010152308.0 | ||
008 | 051117m20042003ii a g b 001 0 eng | ||
020 | _a97881718089843 (pbk) | ||
040 |
_cNCL _dNIF2019 |
||
082 | 0 | 0 |
_a005.1 _bLEV-I 2004 10340 |
100 | 1 | _aLevitin, Anany. | |
245 | 1 | 0 |
_aIntroduction to the design & analysis of algorithms / _cby Anany Levitin. |
246 | _aIntroduction to the design and analysis of algorithms | ||
260 |
_aDelhi : _bPearson Addison-Wesley, _c2004. |
||
300 |
_axxiv, 487 p. : _bill. ; _c24 cm. |
||
504 | _aIncludes bibliographical references and index. | ||
505 | _a1. 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 Limitations of Algorithm Power | ||
650 | 0 | _aComputer algorithms. | |
942 |
_2ddc _cBK |
||
999 |
_c7698 _d7698 |