数组折半查找

折半查找必须是已经排序好的数组

public static void main(String[] args) {

int[] aa = {1,2,3,4};
int num = 6;
int start = 0;
int end = aa.length - 1;
int middel = (start+end)/2;
while(end >= start){
if(num == aa[middel]){
System.out.println(middel);
return;
}else if(num > aa[middel]){
start = middel + 1;
}else if(num < aa[middel]){
end = middel -1;
}
middel = (start+end)/2;
}

System.out.println("查无次数");

//系统自动的查找方法

int ww = Arrays.binarySearch(aa, 1);

}