二分查找算法----java实现

2021新牧码人

于 2016-07-27 13:24:00 发布

阅读量312

点赞数

分类专栏：算法文章标签：算法二分查找

本文链接：https://blog.youkuaiyun.com/qluojieq/article/details/52044651

版权

算法专栏收录该内容

6 篇文章

订阅专栏

传入数组应该是有序的，
    public static int binarySearch(int [] A,int B){
        int low =0;
        int hight = A.length-1;
        while(A[low]<=B&&B<=A[hight]&&low<=hight){

            if(A[(low+hight)/2]==B){
                return (low+hight)/2;
            }else if(A[(low+hight)/2]>B){
                hight = (low+hight)/2-1;
                continue;

            }else if(A[(low+hight)/2]<B){
                low = (low+hight)/2+1;
                continue;
            }
            //if(low==hight){
            //  return low;
            //}
        }

       return -1;
    }