原书出处
Introduction to Algorithms, Fourth Edition
3 第3章 运行时间的刻画
e, 2n = o(n2), but 2n2 ≠ o(n2). The definitions of O-notation and o-notation are similar.
The main difference is that in f (n) = O(g(n)), the bound 0 ≤ f (n) ≤ cg(n) holds for some constant c > 0, but in f (n) = o(g(n)), the bound 0 ≤ f (n) < cg(n) holds for all constants c > 0.
Intuitively, in o-notation, the function f (n) becomes insignificant relative to g(n) as
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea