Algorithm Design: Dynamic Programming Algorithms

Dynamic programming algorithms

Some algorithms break a problem into smaller subproblems and use the subproblems’ solutions to construct the larger one’s solution. During this process, the number of subproblems might become very large. Some algorithms solve the same subproblem repeatedly, needlessly increasing the algorithm’s runtime. Dynamic programming organizes computations to avoid re-computing already known values, which can often save a great deal of time.