java解决排列问题 回溯算法

实现全排列

public class Backtracking {
	public static void main(String[] args) {
		int[] list = { 1, 2, 3, 4 , 5};
		toback(list, 0, list.length-1);
	}
	public static void toback(int[] list,int curr,int size){
		if(curr==size) {
			for(int a:list) {
				System.out.print(a);
			}
			System.out.println();
		}else {
			for(int i = curr;i<=size;i++) {
				change(list, i, curr);
				toback(list, curr+1, size);
				change(list, i, curr);
			}
		}
		
	}
	public static void change(int[] list,int a,int b) {
		int temp = list[a];
		list[a] = list[b];
		list[b] = temp;
	}
}