package Suanfa;
public class ErFen {
//二分查找非递归
public static void main(String[] args) {
int[] arr = {1,3,8,10,11,67,100};
int value = getValue(arr, 11);
System.out.println("value = " + value);
}
public static int getValue(int[] arr,int target){
int left = 0;
int right = arr.length - 1;
while (left <= right){
int mid = (left + right) / 2;
if (arr[mid] == target){
return mid;
}else if (arr[mid] < target){
left = mid + 1;
}else {
right = mid - 1;
}
}
return -1;
}
}
二分查找非递归实现
最新推荐文章于 2024-09-25 11:06:23 发布