Thanks for the many links, but it's not exactly *it*. The first link you give (Permutations and combinations) talks about a different kind of permutations. The second presents a non-recursive algorithm for lexicographic order permutations. The third's title says it all.
In reply to Re^2: recursively generating permutations
by spurperl
in thread recursively generating permutations
by spurperl
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |