二分查找

最新推荐文章于 2023-05-28 13:59:52 发布

墓锦天

最新推荐文章于 2023-05-28 13:59:52 发布

阅读量91

点赞数

分类专栏：代码积累文章标签：二分查找

本文链接：https://blog.csdn.net/policevos/article/details/89576359

版权

代码积累专栏收录该内容

13 篇文章 0 订阅

订阅专栏

public class Test3 {
    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 5, 6, 7, 8,9,22,33,44,55,66,77,88};

        int index = seach(arr,9);
        System.out.println(index);
    }

    public static int seach(int[] arr, int key) {
        int start = 0;
        int end = arr.length-1;
        while (start <= end) {
            int mid = (start + end) / 2;
            if (arr[mid] == key) {
                return mid;
            } else if (key < arr[mid]) {
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }
        return -1;

    }
}