As you can see, 48 bits is not enough to properly shuffle a list of 17 elements. For one thousand element shuffle, more than a kilobyte of randomness is required.
Utter twaddle! What I see is someone adding 2 + 1/log2 * sum of the log2 of an arbitrary list and drawing a random, and wrong, conclusion.
The Knuth-Fisher-Yates shuffle only needs to be able to pick 1 from N -- that is, generate a uniform random number between 1 and N; where N is the number of elements in the array -- as proven by Donald Knuth, arguably the greatest Computer Scientist of the current era.
Discuss.
In reply to Re^2: Shuffling CODONS
by BrowserUk
in thread Shuffling CODONS
by WouterVG
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |