二分查找

jdk自带：Arrays.BinarySearch()和Collections.BinarySearch()

>>>：无符号右移，忽略符号位，高位补零

Arrays.java 

public static int binarySearch(int[] a, int key) {

        return binarySearch0(a, 0, a.length, key);
    }
private static int binarySearch0(int[] a, int fromIndex, int toIndex,
                                     int key) {
        int low = fromIndex;
        int high = toIndex - 1;

        while (low <= high) {
            int mid = (low + high) >>> 1;
            int midVal = a[mid];

            if (midVal < key)
                low = mid + 1;
            else if (midVal > key)
                high = mid - 1;
            else
                return mid; // key found
        }
        return -(low + 1);  // key not found.
    }

注意：如果直接写mid=（low+high）>>1 ,当b很大或a和b都很大时，发生溢出。解决：

1.int mid=(low+high)>>>1;

2.int mid=low+(high-low)>>1;