← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

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

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

terates m times 3 i = RANDOM(1, k) 4 if i ∈ S 5 S = S ⋃ {k} 6 else S = S ⋃ {i} 7 return S

Show that the procedure RANDOM-SAMPLE on the previous page returns a random m-subset S of {1, 2, 3,

… , n}, in which each m-subset is equally likely, while making only m calls to RANDOM. ★

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea