原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
he subproblem of size j. Finally, line 8 returns r[n], which equals the optimal value rn.
The bottom-up and top-down versions have the same asymptotic running time.
The running time of BOTTOM-UP-CUT-ROD is Θ(n2), due to its doubly nested loop structure.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea