Written in a student-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required in an introductory algorithms course. The author emphasizes conceptual understanding before the introduction of the formal treatment of each technique. Popular puzzles are used to motivate students' learning interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises.

Features :

• A student-friendly style that treats algorithms as problem-solving tools and develops algorithmic thinking by using puzzles and games.
• An approach that emphasizes conceptual understanding before the introduction of the formal treatment of each technique.
• A Table of Contents that employs an innovative and more comprehensive taxonomy of algorithm design techniques (first put forth in the author's Dr. Dobb's Journal article published April 2000).
• Contains over 600 exercises and puzzles, with hints for students and solutions for instructors.
• Covers both design and analysis frameworks.
• Includes mathematical analysis of both non-recursive and recursive algorithms, as well as empirical analysis and algorithm visualization.
• Discusses limitations of algorithms and ways to overcome these limitations.

Table of Contents

Preface
1. Introduction
2. Fundamentals of Analysis of Algorithms Efficiency
3. Brute-Force
4. Divide-and-Conquer
5. Decrease-and-Conquer
6. Transform-and-Conquer
7. Space and Time Tradeoff in Algorithms
8. Dynamic Programming
9. Greedy Approach.
10. Limitations of Algorithm Power
11. Coping with the Limitations of Algorithm Power
Appendix A: Useful Formulas for the Analysis of Algorithms
Appendix B: A Short tutorial on Recurrence Relations
Appendix C: Exercise Hints