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

0 vote242 views0 answer
C++
36 votes257 views2 answers
Range of long long in c++
C++
3 votes281 views1 answer
C++ check if string is empty
C++
0 vote230 views1 answer
Can you assign a value to a deleted pointer
C++
0 vote321 views1 answer
How to check sqrt of number is integer c++
C++
1 vote269 views2 answers
Cvtcolor rgb to gray
C++
2 votes261 views1 answer
How to make a comment in c++
C++
5 votes273 views5 answers
How to convert char to int in c++
C++
0 vote277 views1 answer
Get value of enum cpp
C++
0 vote285 views1 answer
C++ public inheritance not getting protected
C++