//二分法查找
int[] array2 = new int[] {-98,-34,2,34,54,66,79,105,210,333};
int dest1 = -34;
int head = 0;
int end = array2.length-1;
while(head <= end) {//等号得有
int mid = (head + end)/2;
if(array2[mid] == dest1) {
System.out.println(mid + 1);
}else if(array2[mid] > dest1){
end = mid;
}else {
head = mid;
}
}
二分法查找
最新推荐文章于 2024-05-02 10:05:47 发布