原书出处
Introduction to Algorithms, Fourth Edition
3 第3章 运行时间的刻画
unctions f (n) and constants c in the table below, give as tight a bound as possible on .
If there is no i such that f(i)(n) ≤ c, write “undefined” as your answer.
f (n) c a. n – 1 0 b. lg n 1 c. n/2 1 d. n/2 2 e. 2 f. 1 g. n1/3 2 Chapter notes Knuth [2
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea