原书出处
Introduction to Algorithms, Fourth Edition
5 第5章 概率分析和随机算法
air coin n times. What is the longest streak of consecutive heads that you expect to see?
We’ll prove upper and lower bounds separately to show that the answer is Θ(lg n).
We first prove that the expected length of the longest streak of heads is O(lg n). The pr
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter005.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea