package interview;
/**
 * 利用java實現非遞迴的二分查詢
 * @author zhoupeng
 *
 */
public class BinaryChop {
	public static void main(String[] args) {
		int [] a={1,2,3,4,5,6,7};
		int b=2;
		BinaryChop.binaryChop(a, b);
	}
	public static int binaryChop(int[] array,int des){
		//首先定義陣列的開始位置和結束位置以及中間位置
		int low=0;
		int high=array.length-1;
		while(low<=high){
			int middle=(high-low)/2;
			if(des==array[middle]){
				System.out.println(array[middle]);
				return middle;
			}else if(des>array[middle]){
				low=middle+1;
			}else if(des<array[middle]){
				high=middle-1;
			}
		}
		return -1;
		
	}
}