数组二分法

最新推荐文章于 2024-07-05 14:56:47 发布

m0_71251536

最新推荐文章于 2024-07-05 14:56:47 发布

阅读量67

点赞数

文章标签： java 算法数据结构

本文链接：https://blog.csdn.net/m0_71251536/article/details/125501002

版权

自己写的：


public class demo {
    public static void main(String[] args) {

        int[] arr = {-99, -88, -40, -13, 1 ,2, 40, 55, 89};
        int a = 1000;
        int head = 0;
        int end = arr.length-1;
        boolean flag = true;
        for (int i = (end - head) / 2; i != head ; i = (end + head) / 2) {
            if (a > arr[i]) {
                head = i;
            } else if (a < arr[i]) {
                end = i;
            } else {
                System.out.println("找到了，位置在" + i);
                flag = false;
                break;
            }
        }
        if (flag) {
            System.out.println("没找到");
        }
    }
}

二分法（课讲）

package test_demo;

public class demo {
    public static void main(String[] args) {

        int[] arr = {-99, -88, -40, -13, 1, 2, 6,40, 55, 89};
        int a = 7;
        int head = 0;
        int end = arr.length - 1;
        boolean flag = true;
        while (head <= end) {
            int mid = (head + end) / 2;
            if (a > arr[mid]) {
                head = mid + 1;
            } else if (a < arr[mid]) {
                end = mid - 1;
            } else {
                System.out.println("找到" + mid);
                flag = false;
                break;
            }
        }
        if (flag) {
            System.out.println("没找到");
        }
    }
}