dynamic programming
Short definition from Wiktionary
Noun
- An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.
We haven’t written up dynamic programming yet: Simple and Standard meanings, examples and a quiz.