A recursive approach (which is what I would use) would involve breaking the problem into isomorphic subproblems: to find all permutations of a string, find all permutations of the string without a ...

Is there an algorithm to find all permutations (with repetition) for a given string? I have come up with a very simple algorithm that permutes strings without repetition, and when I give it an ...