Lovegrove Mathematicals
"Dedicated to making Likelinesses the entity of prime interest"
Several of the algorithms on this website require a distribution to be randomised from A to B, where 1≤A<B≤N. This is achieved in the following way.
Let F be a distribution which is to be randomised from A to B.
The result is that F(A), ..., F(B) will be sorted into random order.