java数组---------二分查找_折半检索

package cn.zxg.arrays2;

import java.util.Arrays;

/**
 * 测试二分查找（折半检索）
 */

public class TestBinarySearch {
    public static void main(String[] args) {
        int[]  arr={1,20,30,5,6,90,80};
        Arrays.sort(arr);
        System.out.println(Arrays.toString(arr));
        System.out.println(myBinarySearch(arr,80));
    }



    public static int myBinarySearch(int[] arr,int value){
        int low=0;
        int high=arr.length-1;
        while (low<=high){
            int mid=(low+high)/2;
            if(value==arr[mid]){
                return mid;
            }
            if(value<arr[mid]){
                high=mid-1;
            }
            if (value>arr[mid]){
                low=mid+1;
            }

        }
        return -1;


    }
}

转载于:https://www.cnblogs.com/zzzao/p/10901983.html