set of string permutation problem

Question

I got this set of string such as "12 13 2 1 444"

I want to generate all of different permutation of this set of integers.

I mean

"12 13 2 1 444"
"13 12 2 1 444"
"12 13 1 2 444"
"1 12 13 2 444"
.....

Could any one help me with Java?

possible duplicate of [Generating all permutations of a given string](http://stackoverflow.com/questions/4240080/generating-all-permutations-of-a-given-string) which is for strings (in Java), but that can *easily* be adapted to integers. — moinudin, Jan 11 '11 at 00:40
@Andy No, I'm not saying you should change to strings. Read that link, it gives answers to the same problem. — moinudin, Jan 11 '11 at 00:43
@Marcog, yes, after I check my question, it should be string .Thanks — Josh Morrison, Jan 11 '11 at 00:45

score 2 · Accepted Answer · answered Jan 11 '11 at 01:21

There are many ways to do this. I think that the best way is to break this down into two steps:

You can split the string into individual values by using the String.split method:

String[] allParts = inputString.split(' ');

Once you have this, you can generate all permutations with one of many permutation generation functions. Leon's link will probably help out here.

score 1 · Answer 2 · answered Jan 11 '11 at 00:37

1

answered Jan 11 '11 at 00:37

Leon

3

I don't think it needs to be recursive. – Tony Ennis Jan 11 '11 at 00:45
2

of course, everything recursive can be done iteratively, but it is just easier to do it recursively – Leon Jan 11 '11 at 00:46

2 Answers2