Description: Establishment generates 0 ~ n (n≤255) a full array of programs, you can choose one or another method to design the following two methods: Method 1: Read n+1 byte data d0, d1, L a random file, dn. The prefetched given a 0 ~ n' s full permutation P (for example, can be 0 ~ n the natural order) starts sequentially for i = n, n-1, L, 1, calculated: j = di-1+di (mod i) the exchange of P i Item item j (In this note we assume P starts 0). Method 2: with a random function to generate m (m> n) bytes of data d1, d2, L, dm. On d1 (mod (n+1)), d2 (mod (n+1)), L, dm (mod (n+1)) followed by visits to the same person behind the emerging removed before the last remaining data in the no The 0 ~ n sequentially written up in the back.
To Search:
File list (Check if you may need any files):
随机全排列.cpp
Download