From: Nick Dokos
Subject: Re: random selection w/o replacement
Date: 
Message-ID: <NICK.91Jul25152237@alphaville.osf.org>
I sent mail to Kevin but I thought that the information I sent
him might be of interest: Jon Bentley discusses a sampling
algorithm (due to Floyd) in Column 13 of his "More Programming
Pearls", Addison-Wesley. The principal advantage of the algorithm
is that if you want a sample of size M out of a population of size
N, you need to call the "random" function exactly M times.

--
Nick Dokos		(ยทยทยทยท@osf.org)
Systems Engineering	(uunet!osf.org!nick)