有序数组二分法查找

public static int binarySearch(int[] array,int value){
    int min =0;
    int max =array.length-1;
    int mid =(min +max)>>>1;
    while(min<=max){
        if (array[mid] < value ) {
            min =mid+1;
        }else if(array[mid] > value ){
            max =mid -1;
        }else{
            return mid;
        }
    }
    return -1;
}