Text
Introduction to the design & analysis of algorithms
Contents:
Machine derived contents note: Preface
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.
No other version available