本书在讲述算法设计技术时采用了新的分类方法，在讨论分析方法时条分缕析，形成了连贯有序、耳目一新的风格。为便于学生掌握，该书涵盖算法入门课程的全部内容，更注重对概念(而非形式）的理解。书中通过一些流行的谜题来激发学生的兴趣，帮助他们加强和提高解决算法问题的能力。每章小结、习题提示和详细解答，形成了很好鲜明的教学特色。

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