Java递归解决全排列问题

Java递归解决全排列问题

public class Perm {

static int[] array = {1,2,3};
public static void swap(int i,int j) {
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}

public static void perm(int[] array,int begin,int end) {
if (begin==end) {
for (int i = 0; i < array.length; i++) {
System.out.println(array[i]);
}
System.out.println("");
} else {

for(int j=begin;j<=end;j++) {
swap(begin, j);
perm(array, begin+1, end);
swap(begin, j);

}

}

}

public static void main(String[] args) {
Perm.perm(array, 0,array.length-1);
}

}