← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

5 第5章 概率分析和随机算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.676Z

1 Probabilistic counting With a b-bit counter, we can ordinarily only count up to 2b – 1.

With R. Morris’s probabilistic counting, we can count up to a much larger value at the expense of some loss of precision.

We let a counter value of i represent a count of ni for i = 0, 1, … , 2b – 1, where the n

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter005.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea