演算法›Ch1 Introduction
第 2 題/共 4 題
◀ AL 2/4
2. 隨機演算法、Fisher-Yates
#AL-01-002中隨機演算法Fisher-Yates

Which of the following □\square generates a uniformly random permutation of an array AA of size nn in place, assuming that RANDOM(ℓ,r\ell, r) returns an integer chosen uniformly at random from {ℓ,ℓ+1,…,r−1,r}\{\ell, \ell+1, \dots, r-1, r\}?

RANDOM-PERMUTE(A) 1 for i = 1 to n 2 □ 3 if a <= b 4 swap A[i] with A[RANDOM(a,b)]

📄 台大115
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch1 Introduction
本章題號 · 1–4 / 4