Text File

Aucf-cs.434 net.math utcsrgv!utzoo!decvax!duke!ucf-cs!bratman Fri Feb 19 14:30:21 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 duke!ucf-cs!bratman

----------------------------------------------------------------- gopher://quux.org/ conversion by John Goerzen <jgoerzen@complete.org> of http://communication.ucsd.edu/A-News/

This Usenet Oldnews Archive article may be copied and distributed freely, provided:

1. There is no money collected for the text(s) of the articles.

2. The following notice remains appended to each copy:

The Usenet Oldnews Archive: Compilation Copyright (C) 1981, 1996 Bruce Jones, Henry Spencer, David Wiseman.