[OT] Algorithm question

Ola Fosheim Grostad via Digitalmars-d digitalmars-d at puremagic.com
Fri May 12 13:20:49 PDT 2017


On Friday, 12 May 2017 at 18:43:53 UTC, H. S. Teoh wrote:
> I'm surprised there are no (known) incremental algorithms for 
> generating
> a random permutation of 0..n that requires less than O(n) space.

I've told you all you need to know...



More information about the Digitalmars-d mailing list