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 vote206 views1 answer
C++ cin accept only numbers
C++
0 vote211 views1 answer
What is blob in computer vision
C++
0 vote218 views1 answer
C++ shared pointer operator bool
C++
5 votes215 views4 answers
Split pdf
C++
1 vote208 views1 answer
Have unique vector after sorting vector
C++
1 vote207 views1 answer
Std means in programming
C++
1 vote202 views3 answers
How to get a random number between two numbers in c++
C++
0 vote250 views1 answer
Vs Code cpp not run
C++
2 votes246 views1 answer
C++ virtual function in constructor
C++
-1 vote238 views1 answer
How to replace an element in array in c++
C++