使用二分查找数组中的元素的索引int[] arr={1,2,4,5,6,7,8,9};

public class demo15 {
public static void main(String[] args) {
int[] arr={1,2,4,5,6,7,8,9};

int index=binarysearch(arr,8);
System.out.println(index);
}
public static int binarysearch(int[] arr,int result){
int index=-1;
int max=arr.length-1;
int min=0;
int mid=(max+min)/2;
if(result>arr[max]||result<arr[min]){
return -1;
}
while(min<=max){
if(result<arr[mid]){
max=mid-1;
}
else if(result>arr[mid]){
min=mid+1;
}else{
index=mid;
break;//新手理解，二分查找的本质就是查中间值然后输出
}
mid=(max+min)/2;
}
return index;
}
}