Question

Advantages of dynamic programming problem

Answer 1

full of expressiveness, save time on writing and compiling code

Answer 2

Answer:

Explanation:

Greedy algorithm have a local choice of the sub-problems whereas Dynamic programming would solve the all sub-problems and then select one that would lead to an optimal solution. Greedy algorithm take decision in one time whereas Dynamic programming take decision at every stage.