← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

A 附录A 求和

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

proof that . Certainly, . Assuming that the bound holds for n, we now prove it for n + 1:

The bug in the argument is that the “constant” hidden by the “big-oh” grows with n and thus is not constant. We have not shown that the same constant works for all n. Bounding the terms You can sometimes obtain a good upper bound on a series by bounding each term of the series, and it often suffices to use the largest term to

bound the others. For example, a quick upper bound on the arithmetic series (A.1) is In g

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea