Table of Content

Preface
Index
1. Introduction
2. Elementary Data Structures
3. Divide-and-Conquer
4. The Greedy Method
5. Dynamic Programming
6. Basic Traversal and Search Techniques
7. Backtracking
8. Branch and Bound
9. Algebraic Problems
10. Lower Bound Theory
11. NP-Hard and NP-Complete Problems
12. Approximation Algorithms
13. PRAM Algorithms
14. Mesh Algorithms
15. Hypercube