java 折半查找

import java.util.Scanner;
public class zheban {

	public static void main(String[] args) {
		//选择排序数组
		int start = 0,end,middle;
		int a[] = {12,45,67,89,123,-45,67};
		int N = a.length;
		for(int i=0;ia[middle])
				start = middle;
			else if(numberN/2)
				break;				
		}
		if(count>N/2)
			System.out.printf("%d不在数组中.\n",number);
		else
			System.out.printf("%d在数组中.\n",number);
	}

}