原书出处
Introduction to Algorithms, Fourth Edition
5 第5章 概率分析和随机算法
utations, we want the probability that any particular permutation is produced to be 1/n!.
You might think that to prove that a permutation is a uniform random permutation, it suffices to show that, for each element A[i], the probability that the element winds up in position j is 1/n.
Exercise 5.3-4 shows that this weaker condition is, in fact, insufficient. Our method to
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter005.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea