DPX Instruction Set
Algorithms built upon problems where optimal solutions to subproblems constitute an optimal solution to the problem itself rely on dynamic programming. A simple example come from the fibonacci numbers. The n-th fibonacci number is known to be the sum of the two previous fibonacci numbers. A recursive algorithm \(\text{fib}(n)=\text{fib}(n-1)+\text{fib}(n-2)\) with base cases or initial conditions \(\text{fib}(0) = 1, \text{fib}(1)=1\) constitute a dynamic programming problem.