- 1) to different permutations. 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 ...

Let's say I have 4 numbers: 1234. I wish to find out all possible permutations of this 4 numbers. I believe there is a total of 12 permutations. I couldnt figure out the logic to actually find out the ...