折半查找法
代碼
public static int bin_Search(int array[],int key){
int mid,high,low=;
high = array.length-;
while(low<=high){
mid=(low+high)/;
if(array[mid]==key){
return mid;
}
if(array[mid]>key){//在前半段查找
high = mid - ;//mid已經找過一次了,是以跳過
}
if(array[mid]<key){//在後半段查找
low = mid + ;//mid已經找過一次了,是以跳過
}
}
return -;
}
轉載于:https://www.cnblogs.com/0427mybirthday/p/7710757.html