| Chapter | Topic |
|---|---|
| Appendix A | Mathematics Review |
| 1 | Algorithms: Efficiency, Analysis, and Order |
| Appendix B | Solving Recurrence Equations |
| 2 | Divide-and-Conquer |
| 3 | Dynamic Programming |
| 4 | The Greedy Approach |
| 5 | Backtracking |
| 6 | Branch-and-Bound |
| 7 | Introduction to Computational Complexity: Sorting |
| 8 | Computational Complexity: Searching | 9 | Computational Complexity and Intractability: An Introduction to the theory of NP |
| 12 | Parallel Algorithms |