SCOUG-Programming Mailing List Archives

>> Next Message >>

Date:	Wed, 16 Apr 2003 19:17:18 PDT
From:	Peter Skye <pskye@peterskye.com >
Reply-To:	scoug-programming@scoug.com
To:	scoug-programming@scoug.com
Subject:	SCOUG-Programming: enumerate all permutations ?

Content Type: text/plain

I need an algorithm which will enumerate all permutations of a given
set.

For example, if I have the three-member set

Attorneys..Criminal..El Cajon

then the results should be the following six arrangements
(permutations):

Attorneys..Criminal..El Cajon
Attorneys..El Cajon..Criminal
Criminal..Attorneys..El Cajon
Criminal..El Cajon..Attorneys
El Cajon..Attorneys..Criminal
El Cajon..Criminal..Attorneys

The results need not be in any particular sequence.

Does anyone know of a simple algorithm to do this?

- Peter

=====================================================

To unsubscribe from this list, send an email message
to "steward@scoug.com". In the body of the message,
put the command "unsubscribe scoug-programming".

For problems, contact the list owner at
"rollin@scoug.com".

=====================================================

Return to [ 16 | April | 2003 ]

SCOUG, Warp Expo West, and Warpfest are trademarks of the Southern California OS/2 User Group. OS/2, Workplace Shell, and IBM are registered trademarks of International Business Machines Corporation. All other trademarks remain the property of their respective owners.