Introduction to the Design & Analysis of Algorithms (Levitin)
Levitin A. 2007. Introduction to the design & analysis of algorithms. 2nd ed. Boston: Pearson Addison-Wesley.
Main Chapters
- Introduction
- Fundamentals of the Analysis of Algorithm Efficiency
- Brute Force
- Divide-and-Conquer
- Decrease-and-Conquer
- Transform-and-Conquer
- Space and Time Tradeoffs
- Dynamic Programming
- Greedy Technique
- Iterative Improvement
- Limitations of Algorithm Power
- Coping with the Limitations of Algorithm Power
- Useful Formulas for the Analysis of Algorithms
- Short Tutorial on Recurrence Relations