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 vote132 views1 answer
Parenthesis Checker using stack in c++
C++
1 vote242 views1 answer
How to compile opencv c++ in ubuntu
C++
0 vote103 views1 answer
Interest rate parity
C++
1 vote163 views2 answers
Rotate array cpp
C++
0 vote149 views1 answer
Ternary operator rsut
C++
12 votes146 views3 answers
Max element in array c++ stl
C++
1 vote150 views1 answer
Roscpp publish int32
C++
0 vote138 views3 answers
Find the smallest window in a string containing all characters of another string
C++
0 vote149 views1 answer
C++ sort
C++
4 votes138 views1 answer
Clear file before writing c++
C++