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

11 votes328 views2 answers
Str remove char c++
C++
1 vote318 views1 answer
Check if double is integer c++
C++
-1 vote305 views1 answer
How to make a hello world program in c++
C++
0 vote289 views1 answer
Copy file to vector c++
C++
1 vote300 views1 answer
How to writt array in c++
C++
1 vote335 views1 answer
How to substract to give a positive outcome in c++
C++
5 votes309 views1 answer
What library to mention for swap function in c++
C++
1 vote368 views1 answer
File descriptor linux c++
C++
0 vote317 views1 answer
C++ set element at index
C++
0 vote304 views1 answer
Apply pca to dataframe
C++