mit 计算机科学及编程导论(13)
2012-07-29 17:27
375 查看
words:
pedagogical , redundant , squirrel sth away , versus , tremendous , phony , straw-man , tedious , decrement
notes:
dynamic programming :
if the sub-problems are overlapping , we can use memorization to optimize . We can record the value at 1st time then we can look it up subsequently instead of computing again .(examples: recursive version of fibonacci
& 0/1 knapsack problem)
0/1 knapsack problem used memorization to solve :
the order of growth is not only decided by the size of the problem , but also by the size of the solution(how many items can be put into the bag). So it is hard to confirm the complexity of the algorithm and the professor have said that in real world
u just can test the algorithm rather than be sure the complexity of them
sum up the dynamic programming:
1. trade space for time
2. it is broadly useful
3. problem reduction: transform sth unfamiliar into sth familiar (write out the mathematical formula and change the constrain , etc)
pedagogical , redundant , squirrel sth away , versus , tremendous , phony , straw-man , tedious , decrement
notes:
dynamic programming :
if the sub-problems are overlapping , we can use memorization to optimize . We can record the value at 1st time then we can look it up subsequently instead of computing again .(examples: recursive version of fibonacci
& 0/1 knapsack problem)
0/1 knapsack problem used memorization to solve :
the order of growth is not only decided by the size of the problem , but also by the size of the solution(how many items can be put into the bag). So it is hard to confirm the complexity of the algorithm and the professor have said that in real world
u just can test the algorithm rather than be sure the complexity of them
sum up the dynamic programming:
1. trade space for time
2. it is broadly useful
3. problem reduction: transform sth unfamiliar into sth familiar (write out the mathematical formula and change the constrain , etc)
相关文章推荐
- mit 计算机科学及编程导论(1)
- mit 计算机科学及编程导论(2)
- mit 计算机科学及编程导论(9)
- mit 计算机科学及编程导论(12)
- mit 计算机科学及编程导论(14,15,16)
- mit 计算机科学及编程导论(6)
- mit 计算机科学及编程导论(17,18,19)
- mit 计算机科学及编程导论(7)
- 计算机科学与编程导论小习题-MIT
- mit 计算机科学及编程导论(10)
- MIT公开课---计算机科学及编程导论
- mit 计算机科学及编程导论(11)
- mit 计算机科学及编程导论(1)
- MIT6.00.1X 计算机科学和PYTHON编程导论 第四周
- MIT开发课程-计算机科学及编程导论-课程简介及数据类型-笔记
- 计算机科学与Python编程导论_MIT 学习笔记(五)
- 计算机科学和编程导论-week3-递归
- MIT6.00.1X 计算机科学和PYTHON编程导论 第三周
- MIT6.00 1x 第一讲-计算机科学简介-笔记
- MIT公开课:计算机科学及编程导论 Python 笔记5 浮点数,逐次逼近法和二分法