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.
Modulerandom-shuffle-0.0.4Haskell98
System.Random.Shuffle
- Packagerandom-shuffle-0.0.4
- Exports3
- LanguageHaskell98
- LicenceBSD-3-Clause
- SourceShuffle.hs
Given a sequence (e1,...en) to shuffle, its length, and a random generator, compute the corresponding permutation of the input sequence.
shuffle' wrapped in a random monad