Introduction to the design & analysis of algorithms
By: Anany Levitin
Edition: 2nd ed.
Publisher: Dorling Kindersley (India)
Published: 2008
Place of publication: Delhii
Language: eng
Number of pages: 524
ISBN-13: 9788131718377
Subjects: Computer algorithms
Other titles: Introduction to the design and analysis of algorithms; Design & analysis of algorithms; Design and analysis of algorithms
Notes: "This edition is manufactured in India and is authorized for sale only in India, Bangladesh, Bhutan, Pakistan, Nepal, Sri Lanka and the Maldives."--Cover

"Pearson education"

Includes bibliographical references (p. 463-472) and index.
Table of contents: title: Introduction; title: Fundamentals of the Analysis of Algorithm Efficiency; title: Brute Force; title: Divide-and-Conquer; title: Decrease-and-Conquer; title: Transform-and-Conquer; title: Space and Time Tradeoffs; title: Dynamic Programming; title: Greedy Technique; title: Iterative Improvement; title: Limitations of Algorithm Power; title: Coping with the Limitations of Algorithm Power; title: Epilogue; title: Appendix A: Useful Formulas for the Analysis of Algorithms; title: Appendix B: Short Tutorial on Recurrence Relations.