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. ... The lexicographic permutations of 0, 1 and 2 ...