Recursive binary search

int binarySearch(int[] A, int low, int high, int x)
{
    if (low > high) {
        return -1;
    }
    int mid = (low + high) / 2;
    if (x == A[mid]) {
        return mid;
    }
    else if (x < A[mid]) {
        return binarySearch(A, low,  mid - 1, x);
    }
    else {
        return binarySearch(A, mid + 1,  high, x);
    }
}

Source: iq.opengenus.org

Similar codes

0 vote341 views1 answer
10^18 data type in c++
C++
1 vote270 views1 answer
&& c++
C++
4 votes310 views3 answers
Static
C++
8 votes320 views3 answers
Stack implementation using class in c++
C++
1 vote314 views1 answer
How to easily trim a str in c++
C++
0 vote320 views1 answer
C++ triple
C++
1 vote293 views1 answer
Go read file to string
C++
1 vote316 views1 answer
How to compare two char* in c++
C++
0 vote300 views1 answer
C2079 'stream' uses undefined class 'std::basic_ifstream<char,std::char_traits<char>>'
C++
1 vote298 views1 answer
Include spaces while reading strings in cpp
C++