二分查找

import java.util.Scanner;
public class Erfenchazhao {
   public static int num[]=new int[]{1,2,3,4,5,6,7,9,10,11,12,13,14,15};
    public static void main(String args[]){
        Scanner in=new Scanner(System.in);
        System.out.println(erfenchazhao(0,num.length-1,9));
    }
    public static int erfenchazhao(int low,int high,int n){
        //查找结束条件
        if(low>high)
            return -1;
        //二分
        int mid=(low+high)/2;
        //根据num[mid]与n的关系做处理
        if(num[mid]==n){
            return mid;
        }else if(num[mid]>n){
            return erfenchazhao(low,mid-1,n);
        } else{
            return erfenchazhao(mid+1,high,n);
        }
    }
}