使用递归实现二分查找数组元素索引， int[] arr = {1,2,3,4,5,6,7,8,9};

public class demo16 {
public static void main(String[] args) {
int[] arr = {1,2,3,4,5,6,7,8,9};
System.out.println(binarysearch(arr,7,arr.length-1,0));
}
public static int binarysearch(int[] arr,int result,int max,int min){
int mid=(max+min)/2;
if(result>arr[max]||result<arr[min]){
return -1;
}
if(result==arr[mid]){
return mid;
}
else if(result<arr[mid]){
return binarysearch(arr,result,mid-1,min);
}else{
return binarysearch(arr,result,max,mid+1);
}
}
}