public static int barrySearch(int[] arr,int target){
if(arr == null){
return -1;
}
int left=0;
int right=arr.length-1;
while(left<=right){
int mid=left+(right-left)/2;
if(arr[mid] == target){
return mid;
}else if(arr[mid]<target){
left=mid+1;
}else{
right=mid-1;
}
}
return -1;
}
二分查找算法
最新推荐文章于 2024-10-01 09:29:45 发布