Java中的二分查找

 二分查找：前提必须是要有序的

	public static void main(String[] args) {
		//二分查找
		int [] data= {1,2,3,4,5};
		int t=4;
		int re=-1;
		int start=0;
		int end=data.length-1;
		
		while(start<=end) {
			int moddle=(start+end)/2;
			if(data[moddle]==t) {
				re=moddle;
				break;
			}else if(data[moddle]<t) {
				start=moddle+1;
			}else {
				end=moddle-1;
			}
		}
		System.out.println(re);
	}