Chapter 14. Dynamic programming¶
Abstract
Streams flow into rivers, and rivers flow into the sea.
Dynamic programming brings together solutions to small problems to answer a larger one, guiding us step by step to the other shore.
Chapter contents¶
- 14.1 Introduction to dynamic programming
- 14.2 Properties of dynamic programming problems
- 14.3 Solving dynamic programming problems
- 14.4 0-1 knapsack problem
- 14.5 Unbounded knapsack problem
- 14.6 Edit distance problem
- 14.7 Summary
- 14.8 Exercises