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
Not really by Gamer)
I know. I was just being silly again. I almost know an answer to this one, except that it requires that the characters start off being sorted. It could be shoehorned into place by storing the original string somewhere, but I don't think that's what Charlie had in mind.
re: Not really
