Henning Thielemann <[EMAIL PROTECTED]> writes: > I did some shuffling based on mergesort, that is a list is randomly split > (unzipped) into two lists and the parts are concatenated afterwards. You > must repeat this some times. It even works for infinite lists.
I think it doesn't guarantee equal probabilities of all permutations. -- __("< Marcin Kowalczyk \__/ [EMAIL PROTECTED] ^^ http://qrnik.knm.org.pl/~qrczak/ _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe