原书出处
Introduction to Algorithms, Fourth Edition
3 第3章 运行时间的刻画
llowing fact. For all real constants a > 1 and b, we have from which we can conclude that
Thus, any exponential function with a base strictly greater than 1 grows faster than any polynomial function.
Using e to denote 2.71828 …, the base of the natural-logarithm function, we have for all
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea