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 vote274 views1 answer
Define c++
C++
0 vote301 views1 answer
Map float
C++
0 vote304 views1 answer
Bash script add another user
C++
0 vote307 views1 answer
Stack implementation through linked list
C++
11 votes323 views2 answers
Str remove char c++
C++
3 votes367 views3 answers
Largest Subarray with Zero Sum
C++
0 vote381 views1 answer
Return array of string in function c++
C++
1 vote300 views1 answer
C++ vector move element to front
C++
0 vote283 views1 answer
Size of a matrix c++
C++
7 votes320 views2 answers
How to concatenate vectors in c++
C++