Article View: comp.theory
Article #1928Re: Looking for random permutation generation algorithms
From: Andrew Mullhaupt
Date: Sat, 09 Jan 1993 17:05
Date: Sat, 09 Jan 1993 17:05
6 lines
647 bytes
647 bytes
Since nobody has proposed it, I will. See Floyd's lovely algorithm as explained in Jon Bentley's _More Programming Pearls_ pp. 139ff. The same thing is also found in Bentley's CACM column. Later, Andrew Mullhaupt
Technical Details
Message-ID:
<1453@kepler1.rentec.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!psinntp!kepler1!andrewReferences:
<1993Jan6.014749.15323@ee.ubc.ca> <1993Jan7.165939.11149@cs.cornell.edu> <2607@usna.NAVY.MIL>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!psinntp!kepler1!andrew From: andrew@rentec.com (Andrew Mullhaupt) Newsgroups: comp.theory Subject: Re: Looking for random permutation generation algorithms Message-ID: <1453@kepler1.rentec.com> Date: 9 Jan 93 17:05:27 GMT References: <1993Jan6.014749.15323@ee.ubc.ca> <1993Jan7.165939.11149@cs.cornell.edu> <2607@usna.NAVY.MIL> Organization: Renaissance Technologies Corp., Setauket, NY. Lines: 6