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.
(In reply to
two ways by Cheradenine)
Problem is that there is supposed to be one call per permutation. I also infer from the fact that the modified string is used as an input into the function that there is no state information stored anywhere other than in the string. I'd asked Charlie for clarification on that while the problem was pending, but it never happened. :-(>
re: two ways
