Dynamic Programming

Tags

comp-sci

An algorithm design method where we solve and [see page 7, cache] the values of smaller sub-problems to solve the larger problem. Dynamic programming is usually efficient if the problem has an optimal substructure and the sub-problem space is small.