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 vote107 views1 answer
Uses of gamma rays
C++
3 votes110 views1 answer
Cpp boilerplate
C++
0 vote98 views1 answer
How to allocate memory for vector c++
C++
0 vote127 views1 answer
Stl reverse sort a array
C++
1 vote104 views1 answer
Get the element at an index list c++
C++
0 vote109 views2 answers
Read a file line by line c++ struct site:stackoverflow.com
C++
2 votes107 views1 answer
Getch c++ library
C++
0 vote121 views1 answer
Heap allocated array in c ++
C++
1 vote127 views1 answer
Find the graph is minimal spanig tree or not
C++
4 votes111 views3 answers
Check lowercase letters c++
C++