static int search(int [] arr , int i){
int len = arr.length;
int ln = 0 , rn = len - 1 , mid ;
while(ln <= rn){
mid = ln + ( rn - ln ) / 2;
if(arr[mid] == i){
return mid;
}
if(arr[mid] > i){
rn = mid - 1;
}
if(arr[mid] < i){
ln = mid + 1;
}
}
return -1;
}
二分查找
最新推荐文章于 2023-05-28 13:59:52 发布