Binary search c++

int binarySearch(int arr[], int l, int r, int x)
{
    if (r >= l) {
        int mid = l + (r - l) / 2;
        if (arr[mid] == x)
            return mid;
        if (arr[mid] > x)
            return binarySearch(arr, l, mid - 1, x);
        return binarySearch(arr, mid + 1, r, x);
    }
    return -1;
}

Source: google.com

Similar codes

1 vote176 views1 answer
What is the associative property of an operator
C++
1 vote198 views2 answers
C++ random between two values
C++
0 vote195 views1 answer
Delete heap array c
C++
6 votes173 views1 answer
Void value not ignored as it ought to be
C++
3 votes189 views1 answer
C++ check if string is empty
C++
7 votes199 views3 answers
C++ get data type
C++
0 vote199 views1 answer
Split the array there is an array val of n integers . A good subarray is defined as
C++
2 votes213 views1 answer
Qchar to char
C++
0 vote146 views1 answer
1ll
C++
12 votes260 views4 answers
How to initialized a 2d vector
C++