Chapter 14. Dynamic Programming¶
Abstract
Streams flow into rivers, rivers flow into the sea.
Dynamic programming combines solutions to small problems into the answer to a large problem, leading us step by step to the other shore of problem-solving.
Chapter contents¶
- 14.1 Introduction to Dynamic Programming
- 14.2 Characteristics of Dynamic Programming Problems
- 14.3 Dynamic Programming Problem-Solving Approach
- 14.4 0-1 Knapsack Problem
- 14.5 Unbounded Knapsack Problem
- 14.6 Edit Distance Problem
- 14.7 Summary