If allPossibleItems
contains two different elements, x and y, then you successively write x and y to the list until it reaches DESIRED_SIZE
. Is that what you really want? If you pick DESIRED_SIZE
sufficiently large, you will have too many recursive calls on the stack, hence the SO exception.
What I’d do (if original has no douplets / duplicates) is:
public <E> List<List<E>> generatePerm(List<E> original) {
if (original.isEmpty()) {
List<List<E>> result = new ArrayList<>();
result.add(new ArrayList<>());
return result;
}
E firstElement = original.remove(0);
List<List<E>> returnValue = new ArrayList<>();
List<List<E>> permutations = generatePerm(original);
for (List<E> smallerPermutated : permutations) {
for (int index = 0; index <= smallerPermutated.size(); index++) {
List<E> temp = new ArrayList<>(smallerPermutated);
temp.add(index, firstElement);
returnValue.add(temp);
}
}
return returnValue;
}