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 ...

Coding examples emplemented using recursion Design an algorithm to print all permutations of a string. For simplicity, assume all character are unique. Generalizing ...

For each digit of the string, its permutations is the number prepended to the set of all other permutations of the remaining digits in the string.<BR><BR>So consider the string 123.