原书出处
Introduction to Algorithms, Fourth Edition
C 附录C 计数与概率
ion (see Exercise C.1-12) to prove the bound where for convenience we assume that 00 = 1.
For k = λn, where 0 ≤ λ ≤ 1, we can rewrite this bound as where is the (binary) entropy function and where, for convenience, we assume that 0 lg 0 = 0, so that H(0) = H(1) = 0. Exercises
C.1-1 How many k-substrings does an n-string have? (Consider identical k-substrings at di
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea