← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

14 第14章 动态规划

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.694Z

n by 1, your program’s running time approximately doubles. Why is CUT-ROD so inefficient?

The problem is that CUT-ROD calls itself recursively over and over again with the same parameter values, which means that it solves the same subproblems repeatedly.

Figure 14.3 shows a recursion tree demonstrating what happens for n = 4: CUT-ROD(p, n) ca

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea