递归分治二分查找斐波那契汉诺塔

二分查找

pubiic static void binarySearch(int[]a ,int low,int high,int value){
	if(low > high)
	return;
	int mid = (low + high) / 2;
	int pivot = a[mid];
	if(value > pivot)
		return (a,mid+1,high,value);
	if(value < pivot)
		return (a,low,mid - 1,value);
	
	return mid;
}

斐波那契数列

public static int fabo(int n)
{
	if(n == 0 || n == 1)
		return n;
	return fabo(n-1) + fabo(n-2);
}

汉诺塔

public static void hano(int n,char from,char buffer,char to) {
		if(n == 1)
		{
			System.out.println("从"+from+ "移动到"+to);
		}
		else {
			hano(n-1, from, to, buffer);
			System.out.println("从"+from+ "移动到"+to);
			hano(n-1, buffer, from, to);
		}
	}