原书出处
Introduction to Algorithms, Fourth Edition
A 附录A 求和
n the harmonic series, no such r exists because the ratio becomes arbitrarily close to 1.
Splitting summations One way to obtain bounds on a difficult summation is to express the series as the sum of two or more series by partitioning the range of the index and then to bound each of the resulting series. For example, let’s find a lower bound on the arithmetic series , which we have already seen has an upper bound of
n2. You might attempt to bound each term in the summation by the smallest term, but since
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix001.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea