Introduction to the Design and Analysis of Algorithms, 3/e (IE-Paperback)

<內容簡介>

• 1  Introduction
• 2  Fundamentals of the Analysis of Algorithm Efficiency
• 3  Brute Force and Exhaustive Search
• 4  Decrease-and-Conquer
• 5  Divide-and-Conquer
• 6  Transform-and-Conquer
• 7  Space and Time Trade-Offs
• 8  Dynamic Programming
• 9  Greedy Technique
• 10  Iterative Improvement
• 11  Limitations of Algorithm Power
• 12  Coping with the Limitations of Algorithm Power
• APPENDIX A
• APPENDIX B