算法题---二分查找

    int binarySearch(int[] arr, int temp) {
        int left = 0;
        int right = arr.length;

        int occurIndex = -1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (arr[mid] == temp) {
                occurIndex = mid;
                break;
            } else if (arr[mid] > temp) {
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }
        return occurIndex;
    }