java高逼格的3行代码搞定二分查找（递归）

函数如下：

private int binarySearch(int[] a, int target, int startIndex, int endIndex) {
        if (null == a || startIndex < 0 || endIndex > a.length || startIndex > endIndex) return -1;
        int index = (endIndex - startIndex) / 2 + startIndex;
        return a[index] == target ? index : a[index] < target ? binarySearch(a, target, index + 1, endIndex) : binarySearch(a, target, startIndex, index - 1);
}

赞一下呗！