原书出处
Introduction to Algorithms, Fourth Edition
5 第5章 概率分析和随机算法
erefore takes approximately b ln b tosses before we can expect that every bin has a ball.
This problem is also known as the coupon collector’s problem, which says that if you are trying to collect each of b different coupons, then you should expect to acquire approximately b ln b randomly obtained coupons in order to succeed.
5.4.3 Streaks Suppose that you flip a fair coin n times. What is the longest streak of co
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter005.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea