基于java的全排列算法

全排列

public static void main(String[] args) {
    char[] ch = {'a','b','c','d','e'};
    fullArray(ch,0);
}
public static void fullArray(char[] ch,int k){    
    if(ch.length==k){                             
        System.out.println(Arrays.toString(ch));  
    }else{                                        
        for (int i = k; i < ch.length; i++) {     
            swap(ch,k,i);                         
            fullArray(ch,k+1);                    
            swap(ch,k,i);                         
        }                                         
    }                                             
}                                                 
private static void swap(char[] ch,int i,int j){  
    char temp = ch[i];                            
    ch[i] = ch[j];                                
    ch[j] = temp;                                 
}