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

3 votes92 views1 answer
Find in set of pairs using first value cpp
C++
10 votes98 views2 answers
C++ convert binary string to decimal
C++
0 vote103 views1 answer
Lru cache gfg
C++
2 votes99 views4 answers
Input 2d vector c++
C++
1 vote101 views2 answers
Check if number is positive or negative in cpp
C++
0 vote95 views1 answer
Unordered map c++
C++
0 vote89 views1 answer
Escribir texto c++
C++
0 vote89 views1 answer
Cpp pushfront vector
C++
6 votes102 views2 answers
Show stack c++
C++
0 vote115 views1 answer
Find the biggest element in the array
C++