[Haskell-cafe] Linear shuffle
Marcin 'Qrczak' Kowalczyk
qrczak at knm.org.pl
Fri Jan 14 10:29:05 EST 2005
Henning Thielemann <iakd0 at clusterf.urz.uni-halle.de> 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
\__/ qrczak at knm.org.pl
More information about the Haskell-Cafe