全排列的递归实现

public class Perm {

static int count;

public static void main(String[] args) {

char[] a="01234".toCharArray();

permutation(a,0,4);

System.out.println(count);

}

public static void swap(char[] a,int m,int n){

char temp=a[m];

a[m]=a[n];

a[n]=temp;

}

public static void permutation(char[] a,int m,int n){

if(m==n){

System.out.println(a);

count++;

}else{

for(int i=m;i<=n;i++){

swap(a,m,i);

permutation(a,m+1,n);

swap(a,m,i);

}

}

}

}