原书出处
Introduction to Algorithms, Fourth Edition
5 第5章 概率分析和随机算法
e array. The procedure RANDOMLY-PERMUTE permutes an array A[1 : n] in place in Θ(n) time.
In its ith iteration, it chooses the element A[i] randomly from among elements A[i] through A[n].
After the ith iteration, A[i] is never altered. RANDOMLY-PERMUTE(A, n) 1 for i = 1 to n 2
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter005.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea