The fundamental approach to solving dynamic programming problems may be characterized as:
A)forward incursion.
B)backwards recursion.
C)total enumeration.
D)networking.

Question

Quizplus · Accepted Answer

Dynamic programming problems are usually solved through backwards recursion, where the solution to a complex problem is built on the solutions of simpler sub-problems. This approach allows for optimal substructure, where the optimal solution to a problem can be determined by the optimal solutions to its sub-problems.

The Fundamental Approach to Solving Dynamic Programming Problems May Be