what is Dynamic Programming
Dynamic Programming
Definition
One of problem solving technique
Split huge problem into many simple subproblems and reduce steps of subproblems.
Then get solution by addition of all subproblems.
Example
if you calculate ,
You can find answer by calculating
However, there is another way in computer.
You can skip some of parts that you already calculated. When you calculate the , you done have to calculate if that number is already calculated.
0 개의 댓글:
댓글 쓰기