算法题：字符串的全排列

public void permulate(String array){
char[] arrs=array.toCharArray();
permulation(arrs,0);
}
public void permulation(char[] arrs, int begin){
if(begin==arrs.length-1){
System.out.print(new String(arrs)+",");
return;
}
for(int j=begin;j<arrs.length;j++){
char temp=arrs[begin];
arrs[begin]=arrs[j];
arrs[j]=temp;

permulation(arrs,begin+1);

temp=arrs[begin];
arrs[begin]=arrs[j];
arrs[j]=temp;
}
}