http:okmij.org*ftp*Haskell/perfect-shuffle.txt

# Documentation

shuffle :: [a] -> [Int] -> [a]Source

Given a sequence (e1,...en) to shuffle, and a sequence (r1,...r[n-1]) of numbers such that r[i] is an independent sample from a uniform random distribution [0..n-i], compute the corresponding permutation of the input sequence.

shuffle' :: RandomGen gen => [a] -> Int -> gen -> [a]Source

Given a sequence (e1,...en) to shuffle, its length, and a random generator, compute the corresponding permutation of the input sequence.

shuffleM :: MonadRandom m => [a] -> m [a]Source

shuffle' wrapped in a random monad