Pseudo-random numbers in [0, n), covering all numbers in n steps?

[Andrei Alexandrescu via Digitalmars-d]

On 02/26/2016 03:34 AM, Joseph Rushton Wakeling wrote:
> http://apfelmus.nfshost.com/articles/random-permutations.html

This touches the input, we just want to cover it.

> http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.150.9347&rep=rep1&type=pdf

This seems like a nice article but I don't find a part relevant to this.


Andrei