二叉查找算法

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/ren365880/article/details/80948334

public class Test {
     public static void main(String[] args) {
         int[] num = new int[10000];
         for(int i = 0;i<10000;i++) {
             num[i] = i;
         }
         findNum(2450, num, 0, 9999);
     }

     public static void findNum(int findNum,int[] num,int low,int heigth) {
        int length = (low + heigth) / 2;
        System.err.println(low+"=="+heigth+"=="+num[length]);
        if(findNum == num[length]) {
            System.err.println("完成");
        }else if(findNum > num[length]){
            findNum(findNum, num, length+1, heigth);
        }else if(findNum < num[length]) {
            findNum(findNum, num, low, length-1);
        }
    }
}