算法小记——二分查找

Jmh-Ethereal

已于 2023-05-31 17:15:42 修改

阅读量63

点赞数 2

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

于 2022-12-23 16:54:05 首次发布

本文链接：https://blog.csdn.net/m0_63138660/article/details/128421481

版权

二分查找

public class MyTest3 {
    public static void main(String[] args) {
        int[] arr = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100};
        int index = getIndex(arr, 30);
        System.out.println(index);
    }

    private static int getIndex(int[] arr, int i) {
        int minIndex = 0;
        int maxIndex = arr.length - 1;
        int centerIndex = (minIndex + maxIndex) / 2;
        while (minIndex <= maxIndex) {
            if (i == arr[centerIndex]) {
                return centerIndex;
            } else if (i < arr[centerIndex]) {
                maxIndex = centerIndex - 1;
            } else if (i > arr[centerIndex]) {
                minIndex = centerIndex + 1;
            }
            centerIndex = (minIndex + maxIndex) / 2;
        }
        return -1;
    }


}