Steven D'Aprano <[EMAIL PROTECTED]> writes: > In the case of CPython, the current implementation uses the Mersenne > Twister, which has a huge period of 2**19937. However, 2081! is > larger than that number, which means that at best a list of 2081 > items or longer can't be perfectly shuffled (not every permutation > can be selected by the algorithm).
Note that each shuffle requires n calls to the PRNG, not just one, which reduces the theoretically safe list size by 1. -- http://mail.python.org/mailman/listinfo/python-list
