原书出处
Introduction to Algorithms, Fourth Edition
5 第5章 概率分析和随机算法
8 return B 5.3-5 Professor Gallup wants to create a random sample of the set {1, 2, 3, …
, n}, that is, an m-element subset S, where 0 ≤ m ≤ n, such that each m-subset is equally likely to be created.
One way is to set A[i] = i, for i = 1, 2, 3, … , n, call RANDOMLY-PERMUTE(A), and then ta
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter005.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea