LISTSERV at the University of Georgia
Menubar Imagemap
Home Browse Manage Request Manuals Register
Previous messageNext messagePrevious in topicNext in topicPrevious by same authorNext by same authorPrevious page (January 1997, week 1)Back to main SAS-L pageJoin or leave SAS-L (or change settings)ReplyPost a new messageSearchProportional fontNon-proportional font
Date:         Sun, 5 Jan 1997 09:18:20 +0200
Reply-To:     Dvora Zomer <epid04@POST.TAU.AC.IL>
Sender:       "SAS(r) Discussion" <SAS-L@UGA.CC.UGA.EDU>
From:         Dvora Zomer <epid04@POST.TAU.AC.IL>
Subject:      Re: Enumeration of a Permutation
Comments: To: Tim Browning <timbrowning@CONSULTEC-INC.COM>
In-Reply-To:  <32CD74AB.37D2@consultec-inc.com>
Content-Type: TEXT/PLAIN; charset=US-ASCII

Dear Tim: you really want to ptint out ALL (!!!!!) permutations? For 12 letters it will be more 100,000,000.

Yours, Ilya Novikov

On Fri, 3 Jan 1997, Tim Browning wrote:

> I have a vexing challenge which I think I can solve (actually have > solved) but I would like to see other/alternative approaches. > > This is the problem: You want to read a character string such as "ABC" > and have a program print out all permutations (arrangements) of the > letters. > > Example: > input string is "ABC" > program prints out ABC, CBA, CAB, ... etc. > > In my specific case, there are 12 letters. > > Any help would be most appreciated. > > Thanks. > > ----------------------------------------------------------- > Tim Browning Voice: 770-594-7799 ext. 8353 > Consultec, Inc. Fax: 770-410-0700 > 9040 Roswell Road, E-mail: tim.browning@consultec-inc.com > Suite 700 timprobe@mindspring.com > Atlanta, GA 30350 > USA > --------------------------------------------------------------- >


Back to: Top of message | Previous page | Main SAS-L page