n个数的全排列

/*数组全排列*/
public static void quanpailie(int[]a,int n){
if(n==a.length-1){
for (int i : a) {
System.out.print(i+" ");
}
System.out.println();
}

for(int i=n;i<a.length;i++){
int temp = a[n];
a[n] = a[i];
a[i] = temp;
quanpailie(a,n+1);
a[i] = a[n];
a[n] = temp;
}
}