New to the Third Edition
Preface
1 Introduction
2 Fundamentals of the Analysis of Algorithm Efficiency
3 Brute Force and Exhaustive Search
4 Decrease-and-Conquer
5 DMde-and-Conquer
6 Transform-and-Conquer
7 Space and Time Trade-Offs
8 Dynamic Programming
9 Greedy Technique
10 lterativelmprovement
11 Limitations of Algorithm Power
12 Coping with the Limitations of Algorithm Power
Epilogue
APPENDIX A
Useful Formulas for the Analysis of Algorithms
APPENDIX B
Short Tutorial on Recurrence Relations
References
Hints to Exercises
Index
