二分查找

面试过程中用递归方式实现二分查找，在这里总结一下：

//递归方式实现
public static int tSearch(int[] arr,int desc,int start,int end){
		while(start<=end){
			int middle = (start+end)/2;
			if(arr[middle]==desc){
				return middle;
			}else if (arr[middle]<desc) {
				return tSearch(arr, desc, middle+1, end);
			}else {
				return tSearch(arr, desc, start, middle-1);
			}
		}
		return -1;
	}
	//循环方式实现
	public static int tSearch(int[] arr,int desc){
		int start=0,end=arr.length-1;
		while(start<=end){
			int middle=(start+end)/2;
			if(arr[middle]==desc){
				return middle;
			}else if (arr[middle]<desc) {
				start=middle+1;
			}else {
				end=middle-1;
			}
		}
		return -1;
	}
	
	public static void main(String[] args) {
		int[] arr={10,11,12,13,14,15,16,17,18};
		//System.out.println(tSearch(arr, 10, 0, arr.length-1));
		System.out.println(tSearch(arr, 13));
	}