全排递归实现

package cn.doodlister;

public class Main {

	public static void main(String[] args) {
		int a[]={1,2,3};
		prem(a,0,a.length-1);
	}
	public static void swap(int arr[],int a,int b){
		int temp;
		temp=arr[a];
		arr[a]=arr[b];
		arr[b]=temp;
	}
	public static void prem(int arr[],int start,int end){
		if(start==end){
			for(int i=0;i<=end;++i){
				System.out.print(arr[i]);
			}
			System.out.println();
		}else{
			for(int j=start;j<=end;++j){
				swap(arr,start,j);
				prem(arr,start+1,end);
				swap(arr,start,j);
			}
		}
	}
}