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 vote242 views1 answer
Vermífugo significado
C++
3 votes257 views3 answers
Last character of std::string
C++
1 vote247 views1 answer
Qt messagebox
C++
3 votes254 views2 answers
Search in vector of pairs c++
C++
0 vote255 views1 answer
Udo apt install dotnet-sdk-5
C++
0 vote247 views1 answer
Mid of linked list
C++
8 votes246 views6 answers
C++ while loop
C++
2 votes240 views1 answer
How to make a comment in c++
C++
1 vote238 views1 answer
What is time complexity of min_element()
C++
5 votes241 views1 answer
Best clips recording software for cs go
C++