Dynamic programming

214 views
143 views

Published on

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
214
On SlideShare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
7
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Dynamic programming

  1. 1. DYNAMICDYNAMICPROGRAMMIPROGRAMMINGNGName: MD.MojibulHoqueRoll: 504Registration: WUB3/10/23/504
  2. 2. DYNAMIC PROGRAMMING Dynamic Programming is an algorithm designtechnique for optimization problems: oftenminimizing or maximizing. Like divide and conquer, DP solves problems bycombining solutions to sub-problems. Unlike divide and conquer, sub-problems are notindependent. Sub-problems may share sub-sub-problems,
  3. 3. DYNAMIC PROGRAMMING The term Dynamic Programming comes fromControl Theory, not computer science.Programming refers to the use of tables (arrays)to construct a solution. In dynamic programming we usually reduce timeby increasing the amount of space We solve the problem by solving sub-problems ofincreasing size and saving each optimal solutionin a table (usually). The table is then used for finding the optimalsolution to larger problems. Time is saved since each sub-problem is solvedonly once.

×