Dynamic Programming
Dynamic Programming
Free theory articleDynamic Programming
Concept & interpretation
Dynamic Programming (DP) is an algorithmic paradigm that solves a complex problem by breaking it down into a collection of simpler subproblems. Unlike simple recursion, which may compute the same subproblem multiple times, dynamic programming systematically stores the results of these subproblems so that they can be reused later. This caching mechanism drastically reduces the time complexity of the algorithm, often transforming exponential-time algorithms into polynomial-time ones.