March 25, 2009
2:59 a.m.
Greg> Think about it: A shuffling algorithm is a function from a random Greg> number to a permutation. There's no way you can get more permutations Greg> out than there are random numbers to put in.
If our random number generator can produce more possible shuffles than there are atoms in the universe, I say you don't worry about it. Raymond