Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site inuxc.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxl!ihnp4!inuxc!fred
From: fred@inuxc.UUCP (Fred Mendenhall)
Newsgroups: net.micro.pc
Subject: Programing Puzzle
Message-ID: <994@inuxc.UUCP>
Date: Fri, 20-Jul-84 17:21:51 EDT
Article-I.D.: inuxc.994
Posted: Fri Jul 20 17:21:51 1984
Date-Received: Sat, 21-Jul-84 04:38:51 EDT
Organization: AT&T Consumer Products Div., Indianapolis
Lines: 24


	Here is a interesting problem that has annoyed me all
afternoon. I thought I might post it to the net
and see what solutions some of you midnight hackers come up with.

	" Given an array of n unique elements, print every possible
	  permutation of the array."
	(eg the array (1,2,3) would cause the following to be printed
		123
		132
		312
		321
		231
		213)
		
For the sake of discussion lets say that n can range from 1 to 20, 
and lets talk about solutions using basic, pascal, forth, or lisp.

	My bet is that lisp will generate the most elegant solution
to this problem, if I can figure out how to program the stupid thing.

				
				Fred Mendenhall
				AT&T CP