Aucf-cs.433
net.games
utzoo!decvax!duke!ucf-cs!bratman
Fri Feb 19 14:21:12 1982
PERMUTATIONS
	I'm looking for a very fast, nifty algorithm for calculating
permutations. Given an array of elements size N in a linear vector,
we know that by switching 2 elements at a time we can generate
N factorial non-duplicate permutations. However, when N >= 15, the
number of calculations done by a recursive routine forming these
permutations becomes time-prohibitive. Does anyone have some suggestions
or perhaps a working algorithm for streamlining this procedure? I'd
appreciate any input.

					Steve Bratman
					University of Central Florida