算法设计与分析--全排列

public class quanpailie {
	
	    public static void main(String[] args) {  
	        int[] a = {1,2,3};  
	        test(a,0);  
	         
	    }  
	    public static void test(int[] a,int t){  
	        if(t>=a.length){   
	            System.out.println(java.util.Arrays.toString(a));  
	        }  
	        for (int i = t; i < a.length; i++) {  
	            {
	            	int k = a[t];a[t] = a[i];a[i] = k;
	            	}
	            test(a,t+1);
	            {
	            	int k = a[t];a[t] = a[i];a[i] = k;
	            	}
	        }  
	    }  
	}