January 01, 2000
Algorithm Alley
for ( Src = 0; Src < N; Src++ )
{
Dest = rand() % N; // All N positions equally likely
Swap (X[Src], X[Dest]);
}
Example 1: C++ implementation of shuffling algorithm that does not generate all permutations with equal probability.
Previous Page |
1
|
2
|
3
|
4
|
5
|
6
|
7
|
8
|
9
Next Page
|
 |
|
|||||||||||||||||||||||||||
|
|
|
