Introduction to the design & analysis of algorithms /
Introduction to the design and analysis of algorithms
Anany Levitin
- 2nd ed
- Boston : Pearson Addison-Wesley, c2007
- xxiii, 562 p. : ill. ; 24 cm
Includes bibliographical references (p. 487-496) and index
Introduction -- Fundamentals of the Analysis of Algorithm Efficiency -- Brute Force -- Divide-and-Conquer -- Decrease-and-Conquer -- Transform-and-Conquer -- Space and Time Tradeoffs -- Dynamic Programming -- Greedy Technique -- Iterative Improvement -- Limitations of Algorithm Power -- Coping with the Limitations of Algorithm Power