Contains:
Introduction, Fundamental Concepts of Algorithm Analysis Efficiency, Brute Force and Exhaustive Search, Reduction and Dominance, Divide and Conquer, Transformation and Dominance, Spatial and Temporal Compromises, Dynamic Programming, Greedy Technique, Iterative Improvement, Limiting Algorithmic Power, Dealing with the Limitations of Algorithmic Power, Hints for Exercise Solutions, Conclusion, Appendix A: Useful Relations for Algorithm Analysis, Appendix B: A Brief Introduction to Recursive Relations, Bibliography, Glossary.