二分查找

//折半查找，二分查找public class Test {    public static void main(String[] args) {        int[] ints = {11, 22, 33, 44, 55, 66, 77, 88};        int search = biSearch(ints, 66);        System.out.println(search);    }    private static int biSearch(int[] arr, int value) {        int max = arr.length - 1;        int min = 0;        int mid = (max + min) / 2;        while ( arr[mid]!=value) {            if (arr[mid] > value) {                max = mid - 1;            }            if (arr[mid] < value) {                min = mid + 1;            }            if (min > max) {                return -1;            }            mid = (max + min) / 2;        }        return mid;    }}

结果：5