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 vote138 views1 answer
Argsort c++
C++
0 vote356 views1 answer
Vector size for loop
C++
1 vote109 views1 answer
How to get mouse position on window sfm;
C++
0 vote109 views1 answer
C++ measure time in microseconds
C++
8 votes109 views6 answers
Char to int in c++
C++
0 vote113 views1 answer
C++ pi float
C++
0 vote117 views2 answers
C++ 14 for sublime windoes build system
C++
1 vote126 views1 answer
Qt messagebox
C++
2 votes126 views1 answer
How to make crypto
C++
1 vote125 views1 answer
C++ random number 0 to 1
C++