Xref: utzoo sci.math:17500 comp.lang.c:39355
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!decwrl!pa.dec.com!hollie.rdg.dec.com!decuk.uvo.dec.com!nntpd.lkg.dec.com!ryn.mro4.dec.com!allvax.enet.dec.com!jroth
From: jroth@allvax.enet.dec.com (Jim Roth)
Newsgroups: sci.math,comp.lang.c
Subject: Re: Shuffle generation
Message-ID: <4874@ryn.mro4.dec.com>
Date: 17 May 91 12:20:21 GMT
Sender: guest@ryn.mro4.dec.com
Followup-To: sci.math
Organization: Digital Equipment Corporation
Lines: 13


In article <4787@osc.COM>, jgk@osc.COM (Joe Keane) writes...
> ... stuff deleted ...
> 
>Note that if you seed your random-number generator with a 32-bit integer, then
>there are only 2^32 possible permutations, no matter how big the array is.  If
>you worry about such things, like i do, then you should make multiple passes
>over the array.

This won't result in any more possible permutations, only a different
set of them.

- Jim