25/03/2023 5:32 pm
Topic starter
Notifications
Clear all
0
explain
jisha.c 26/03/2023 11:53 am
Dynamic programming is a computer programming technique where an algorithmic problem is first broken down into sub-problems, the results are saved, and then the sub-problems are optimized to find the overall solution — which usually has to do with finding the maximum and minimum range of the algorithmic query.
3 Answers
0
26/03/2023 4:13 am
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-compute them when needed later.
0
26/03/2023 3:18 pm
Dynamic programming is a algorithm design technique, the problem is broken down into subproblems which solve some part of the original problem, the results of these subproblems are stored using ‘memoization’ and reused when same subproblem arises. By combining solutions to all subproblems the final solution is created.
0
01/04/2023 11:06 am
Dynamic Programming is a technique in computer programming that helps to efficiently solve a class of problems that have overlapping subproblems and optimal substructure property.
