BinarySearch折半查找算法

BinarySearch折半查找算法

    public static void main(String[] args) {
        int[] number = new int[9999999];
        for(int i=1;i<=9999999;i++){
            number[i-1]=i;
        }
//        System.out.println(Arrays.toString(number));
        int target=88;
        int low=0;
        int hight=number.length-1;
        //折半的索引
        int binarynumber=0;
        //记录次数
        int count=0;
        //计算开始时间
        long startTime = System.currentTimeMillis();
       while (true){
           count++;
           binarynumber=(low+hight)/2;
           if(number[(binarynumber)]<target){
               low=binarynumber;
           }
           if(number[(binarynumber)]>target){
               hight=binarynumber;
           }
           if(number[(binarynumber)]==target){
               //计算开始时间
               long endTime = System.currentTimeMillis();
               System.out.println("目标数索引:"+binarynumber+"寻找次数:"+count+("程序运行时间：" + (endTime - startTime) + "ms"));
               break;
           }
       }
    }