查找算法之二分法查找

package TestOne.panda;

public class SearchTwo {
    public SearchTwo(int target, int[] arr) {
        //记录开始位置
        int begin = 0;
        //记录结束位置
        int end = arr.length - 1;
        //记录中间位置
        int middle = (begin + end) / 2;
        //记录下标
        int index = -1;
        //int[] arr = new int[]{1,2,3,4,5,6,7,8,9,10};
        //无限次循环  直到找到目标元素
        while (true) {
            //如果中间元素恰好是目标元素，记录下标，退出循环
            if (arr[middle] == target) {
                index = middle;
                break;
                //如果目标元素小于中间元素
            } else if (arr[middle] > target) {
                end = middle-1;
                //如果目标元素大于中间元素
            } else {
                begin = middle+1;
            }
            //改变中间位置
            middle=(begin+end)/2;
        }
        System.out.println("index: " + index);
    }
}

package TestOne.dog;

import TestOne.panda.SearchTwo;

public class TestSearchTwo {
    public static void main(String[] args) {
        int[] arr = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
        int target = 10;
        new SearchTwo(target, arr);
    }
}