Computer scienceAlgorithms and Data StructuresAlgorithmsPrinciples and techniquesDynamic programming

Dynamic programming basics

Theory

The steps of the DP approach

Report a typo

Assume we know that a problem PP can be solved using dynamic programming. Place the steps below in the order in which they should be applied to solve this problem.

Put the items in the correct order
Combine the solutions of subproblems to get an answer for the initial problem.
Continue the division until subproblems become simple enough to be solved directly.
When a subproblem is solved, save its solution and reuse it if necessary.
Divide a problem into smaller subproblems.
___

Create a free account to access the full topic