Newsgroups: comp.ai.neural-nets
From: dave.woolcock@moorsmal.demon.co.uk (dave woolcock)
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!news.alpha.net!uwm.edu!newsspool.doit.wisc.edu!night.primate.wisc.edu!nntp.msstate.edu!emory!swrinde!pipex!bt!btnet!peernews.demon.co.uk!moorsmal.demon.co.uk!dave.woolcock
X-Newsreader: WcNews for Wildcat! V1.5 [UnReg]
Subject: Generating permutations
Organization: Computer Room BBS
Reply-To: dave.woolcock@moorsmal.demon.co.uk
Lines: 13
X-Posting-Host: moorsmal.demon.co.uk
Date: Sun, 19 Mar 1995 12:16:46 +0000
Message-ID: <509970003snz@moorsmal.demon.co.uk>
Sender: usenet@demon.co.uk


JK> OK, this might be a weird question for this group, but *somebody* will
  > know the answer to it!  What are some good algorithms for generating
  > all the permutations of a set of items?  Given there are n! possible
  > orders for n items, I would like to be able to create a matrix, or

Wouldn't counting in base-n do it?

dw

---
 * SPEED 1.40 #2247 * 
 * The Computer Room BBS, Preston, Lancs, UK (01772 731636) 24 hour
