Find an algorithm (subroutine) that when called repeatedly with the same character-string variable that is initialized with n characters, all different, will cycle through all the permutations of those n characters, so that for example, when called 24 times with a string of length 4, will have cycled that string through all 24 permutations and returned it to its initial state.

No offense, but that's not an algrorithm, that's programming. If I said "Create a permutarion" as my answer (or some such thing), I would have to say what a permutation is.

Posted by Gamer on 2003-07-03 03:08:17