Article View: comp.theory
Article #1896Re: Looking for random permutation generation algorithms
From: R0264
Date: Wed, 06 Jan 1993 21:57
Date: Wed, 06 Jan 1993 21:57
24 lines
1543 bytes
1543 bytes
In article <1993Jan6.014749.15323@ee.ubc.ca> rayw@ee.ubc.ca (raymond w m woo) writes: > >Hi, does anyone know, or can provide any pointer in the literature to, any >random permutation generation algorithm that can be easily implemented as a >function in a computer program? > >Ideally, this function would be computationally effective, and the input >that this function takes would be some kind of index/rank number of the >permution to be generated. > >But of course, I am interested in knowing *all* kinds of permutation generation >algorithms. > >Many thanks in advance! Best of wishes for 93. >-- > R Woo <rayw@ee.ubc.ca> | When correctly interpreted, pi conveys the entire > Elec. Eng., UBC, Canada | history of the human race! --accord. to Dr. Matrix There are a couple of articles on such routines in Behavior Research Methods Instruments & Computers. See Castellan, N. J. (1992), Shuffling arrays: appearances may be deciving. 24,72-77. The other one is cited there, and is by Brysbaert.
Technical Details
Message-ID:
<16B4EEEA1.R0264@vmcms.csuohio.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!magnus.acs.ohio-state.edu!usenet.ins.cwru.edu!news.csuohio.edu!vmcms.csuohio.edu!R0264References:
<1993Jan6.014749.15323@ee.ubc.ca>Show Full Headers
Complete Article Headers
Newsgroups: comp.theory,sci.crypt,sci.math,rec.puzzles Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!magnus.acs.ohio-state.edu!usenet.ins.cwru.edu!news.csuohio.edu!vmcms.csuohio.edu!R0264 From: R0264@vmcms.csuohio.edu Subject: Re: Looking for random permutation generation algorithms Message-ID: <16B4EEEA1.R0264@vmcms.csuohio.edu> Sender: news@news.csuohio.edu (USENET News System) Organization: CSU References: <1993Jan6.014749.15323@ee.ubc.ca> Date: Wed, 6 Jan 1993 21:57:58 GMT Lines: 24