二分查找法

/**
 * Created by 薛超 on 2021-03-13.
 * 二分查找法
 */
public class Test2 {

    public static void main(String []args){
        int[] array = {1,3,5,7,9,10,11,13,15,14,16,18};
        int target = 16;//目标数
        int start = 0;//开始位置
        int end = array.length-1;//结束位置
        int middle;//中间位置
        while(start<=end){
            middle = (start+end)/2;
            if(target==array[middle]){
                System.out.println("找到："+middle);
                return;
            }else if(target>array[middle]){
                start = middle+1;
            }else if(target<array[middle]){
                end = middle-1;
            }
        }
        System.out.println("不存在");
    }
}