Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!ucbvax!sequent.cc.hull.ac.uk!sm2
From: sm2@sequent.cc.hull.ac.uk (Simon Marshall)
Newsgroups: comp.theory
Subject: Numbers...
Message-ID: <15996.9105201547@seq.hull.ac.uk>
Date: 20 May 91 15:47:07 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Lines: 10


	Hi, does anybody know of an efficient algorithm to iteratively
     produce all numbers consisting of x digits where each digit is used
     at most once?  ie.  58912, 01246 are valid; 58918, 01046 are not.
	Many thanks.  Simon.
_______________________________________________________________________________
Simon Marshall, Dept. of Computer Science, University of Hull, Hull HU6 7RX, UK
	      "``La la la la la la la la la'' means I love you."
	EMAIL:	S.Marshall@Hull.ac.uk		UUCP:	..!ukc!hu-cs!sm
    Telephone:	+44 482 465951 (office)		 Fax:	+44 482 466666