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 vote183 views1 answer
At c++ vector
C++
2 votes247 views1 answer
How to make a comment in c++
C++
-1 vote247 views1 answer
C++ forloop
C++
20 votes217 views5 answers
File c++
C++
0 vote255 views1 answer
How to find product of a given numbers in c++
C++
0 vote177 views1 answer
Count bit 1 c++
C++
0 vote223 views1 answer
Sync_with_stdio
C++
0 vote223 views1 answer
Two D Arrays
C++
5 votes145 views4 answers
Int length c++
C++
0 vote252 views1 answer
Lnk2001 unresolved external symbol __imp_PlaySoundA
C++