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

3 votes284 views1 answer
How i say hello world in c++
C++
1 vote294 views1 answer
Eosio get time
C++
0 vote298 views1 answer
How to get an element in a list c++
C++
1 vote283 views1 answer
C++ shortcuts in desktopp app
C++
0 vote284 views1 answer
Cstring to string
C++
0 vote320 views1 answer
Constexpr std::round c++
C++
1 vote292 views1 answer
What is the meaning of life and everything in the universe
C++
-1 vote272 views1 answer
How to initialize static member variable of a class in c++
C++
0 vote288 views1 answer
C++ erase remove
C++
0 vote283 views1 answer
C++ while true
C++