public class BinarySearchNoRecur {
public static void main(String[] args) {
int []arr= {1,3,8,10,11,67,100};
int index=binarySearch(arr, 8);
System.out.println(index);
}
public static int binarySearch(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){ //比关键字大则关键字在左区域
right=mid-1;//向左边查找
}else {
left=mid+1;//向右边查找
}
}
return -1;
}
}