二分查找

public class BinarySearch {

	public static void main(String[] args) {
		double[] arr={1,2,3,4,5,6,7,8,9,10,11,12};
		int left=0;
		int right = arr.length-1;
		double search =7.5;
		int m = 0;
		while(true){
			m=(left+right)/2;
			if(arr[m]==search){
				break;
			}else if (search<arr[m]) {
				right=m;
			}else if (search>arr[m]) {
				left=m;
			}
			if((right-left)==1){
				if(arr[right]==search){
					m=right;
				}else if(arr[left]==search){
					m=left;
				}else {
					m=-1;
				}
				break;
			}
		}
		System.out.println("索引地址:"+m);
		
		

	}

}