Dynamic Programming

A technique in algorithmic problem solving which involves breaking down a problem into a series of smaller ones (subproblems) and solving them separately. This way, when the same subproblem emerges, there is already a solution for it. It is an optimization method of sorts.

Learn more

First released 1953
Developed by Richard Bellman

Interesting facts

Richard Bellman was the first one to define the term, although when he first used it in 1940's, it was to describe the process of finding the best decision for each step.

4

Development by Synergize.digital

Sign up for updates
straight to your inbox