全排列算法

public class MyAllSortTest1 {
//private static int m=4;
public static void Allsort(int a[],int k,int m) {
if (k==m) {
for (int i = 0; i <= m; i++) {
System.out.print(a[i]);
}
System.out.println();
}
else {
for (int i = k; i <=m; i++) {
int a1=a[k];
a[k]=a[i];
a[i]=a1;
Allsort(a, k+1, m);
a1=a[k];
a[k]=a[i];
a[i]=a1;
}
}
}
public static void main(String[] args) {
int a[]={1,2,3,4};
Allsort(a,0,a.length-1);
}
}