手把手带你解析蓝桥云课《算法很美》--2.7二分查找的递归解法

public class 二分查找 {

  public static void main(String[] args) {
    // TODO Auto-generated method stub
    int [] arr= {24,56,68,70,77,94,98};
    int n=select(arr,94,0,arr.length-1);
    System.out.println(n);
  }
  
  static int select(int []arr,int target,int low,int high) {
    if(low>high) {
      return -1;
    }
    int middle=(low+high)/2;
    if(arr[middle]>target) {
      return select(arr,target,low,middle-1);
    }
    else if(arr[middle]<target) {
      return select(arr,target,middle+1,high);
    }
    else {
      return middle;
    }
  }

}