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

56 votes181 views6 answers
List conda environments
C++
2 votes146 views2 answers
C++ typedef array
C++
1 vote193 views1 answer
Rank() in c++
C++
0 vote176 views1 answer
Heroatx77
C++
1 vote161 views1 answer
Isalpha c++
C++
0 vote146 views1 answer
Log base 10 c+_+
C++
3 votes145 views2 answers
C++ vector element search
C++
0 vote152 views1 answer
How to use qdebug c++
C++
3 votes201 views6 answers
C++ for loops
C++
0 vote197 views1 answer
Sort strings by length and by alphabet
C++