没有bug的二分查找

public static int binarySearch(int arr[], int value) {
        int l = 0, r = arr.length;
        while (l <= r) {
            int mid = l + (r - l) / 2;
            if (arr[mid] == value)
                return mid;
            else if (value > arr[mid])
                l = mid + 1;
            else
                r = mid - 1;
        }
        return -1;
    }