北航C++教程.pptVIP

* * * * * * * * * 5.3.2 Randomly permuting an array (2) RANDOMIZE-IN-PLACE RANDOMIZE-IN-PLACE(A, n) for(i=1; i=n; i++) swap(A[i], A[RANDOM(i, n)] Lemma RANDOMIZE-IN-PLACE computes a uniform random permutation. Proof Loop invariant: Pr{A[1 .. i-1] contains each (i-1)-permutation} = (n-i+1)!/n! . Maintenance: … … i-permutation R=x1, x2, … , xi = x1, x2, … , xi ∪ xi = R’ ∪ xi . Let E1 be the event that the algorithm actually puts R’ into A[1 .. i-1] . By the loop invariant, Pr{E1}=(n-i+1)!/n! . Let E2 be the event that the ith iteration puts xi into A[i]. We get the i-Permutation R in