java二分查找法

 public static int binarySearch(int[] srcArray, int des) {
        int low = 0;
        int high = srcArray.length - 1;
        while ((low <= high) && (low <= srcArray.length - 1) && (high <= srcArray.length - 1)) {
            int middle = (high + low) / 2;
            if (des == srcArray[middle]) {
                return middle;
            } else if (des < srcArray[middle]) {
                high = middle - 1;
            } else {
                low = middle + 1;
            }
        }
        return -1;
    }

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