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 vote208 views1 answer
Execute executable in c++
C++
0 vote264 views1 answer
How to get an element in a list c++
C++
1 vote267 views1 answer
Get an array with c++
C++
0 vote287 views1 answer
Operator overloading outside class
C++
0 vote271 views1 answer
How to turn an integer variable into a char c++
C++
0 vote248 views1 answer
Full implementation of binary search tree in C++
C++
0 vote253 views1 answer
C++ capture screen as pixel array
C++
1 vote246 views3 answers
Print 2d array c++
C++
5 votes219 views2 answers
Variables in c++
C++
5 votes266 views1 answer
All library in c++
C++