Breaking News: Grepper is joining You.com. Read the official announcement!

Dynamic Programming

Add Answer

Hilarious Hummingbird answered on May 31, 2022 Popularity 10/10 Helpfulness 2/10

answer Dynamic Programming

related dynamic programming

related what is dynamic programming

Dynamic Programming

Comment

//_divide & conquer + memoization == top-down dynamic programming
Well, recursion+memoization is precisely a specific "flavor" of dynamic programming: dynamic programming in accordance with top-down approach.
More precisely, there's no requrement to use recursion specifically. Any divide & conquer solution combined with memoization is top-down dynamic programming. (Recursion is LIFO flavor of divide & conquer, while you can also use FIFO divide & conquer or any other kind of divide & conquer).

So it is more correct to say that
divide & conquer + memoization == top-down dynamic programming

Also, from a very formal point of view, if you implement a divide & conquer solution for a problem that does not generate repetitive partial solutions (meaning that there's no benefit in memoization), then you can claim that this divide & conquer solution is a degenerate example of "dynamic programming".
However, dynamic programming is a more general concept. Dynamic programming can use bottom-up approach, which is different from divide & conquer+memoization.

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: stackoverflow.com

Tags: dynamic-programming whatever

Link to this answer
Share Copy Link

Contributed on Jun 28 2022

Hilarious Hummingbird

0 Answers Avg Quality 2/10

Closely Related Answers

dynamic programming

Comment

Dynamic programming is used where we have problems, 
which can be divided into similar sub-problems, 
so that their results can be re-used.

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: www.tutorialspoint.com

Tags: dynamic-programming dyna

Link to this answer
Share Copy Link

Contributed on May 31 2022

Markhor

0 Answers Avg Quality 2/10

what is dynamic programming

Comment

Dynamic programming amounts to breaking down an optimization problem into simpler sub-problems, 
and storing the solution to each sub-problem so that each sub-problem is only solved once.

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: www.freecodecamp.org

Tags: dynamic-programming dyna

Link to this answer
Share Copy Link

Contributed on Sep 02 2022

Mahdi Jafari

0 Answers Avg Quality 2/10

Dynamic Programming

Contents

More Related Answers

Dynamic Programming

Closely Related Answers

dynamic programming

what is dynamic programming

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.