Java 二分叉查找

最新推荐文章于 2023-04-05 17:37:25 发布

chkaka

最新推荐文章于 2023-04-05 17:37:25 发布

阅读量1.7k

点赞数

分类专栏：算法文章标签： Java

本文链接：https://blog.csdn.net/h70614959/article/details/38121837

版权

算法专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Java 二分叉查找

   Integer[] list = new Integer[]{10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
        int start = 2;
        int end =9;
        int low = 0;
        int hight = list.length - 1;
        int index = 0;
        while (low < hight) {
            index = (hight+low) % 2 == 0 ? (hight+low) / 2 : (hight+low + 1) / 2;
            if (list[index] < end) hight = index - 1;
            else if (list[index] > end) low = index + 1;
            else {
                System.out.println(list[index]);
                break;
            }
        }

        for (int i = index + 1; i < list.length; i++) {
            if (list[i] < start) break;
            System.out.println(list[i]);
        }