Biology, asked by cosmersurya5679, 1 year ago

Comment on dynamic programming algorithms.

Answers

Answered by prakashsatya10
0

Dynamic Programming is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of subproblems, so that we do not have to re-comupute them when needed later. This simple optimization reduces time complexities from exponential to polynomial. For example, if we write simple recursive solution for Fibonacci Numbers, we get exponential time complexity and if we optimize it by storing solutions of subproblems, time complexity reduces to linear.

plz mark as brainliest

Answered by MRSmartBoy
0

Explanation:

Beginners dynamic programming algorithm

Similar questions