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 vote285 views1 answer
Format string cpp
C++
0 vote273 views1 answer
Choose endianness in cpp
C++
0 vote278 views1 answer
C++ declare binary number
C++
0 vote428 views2 answers
C++ language
C++
3 votes295 views1 answer
Abs c++
C++
0 vote304 views1 answer
C++ find index of all occurrences in string
C++
0 vote268 views1 answer
RotateArray
C++
1 vote309 views1 answer
If not defined c++
C++
0 vote273 views1 answer
Hello world in c/++
C++
0 vote277 views1 answer
How to allocate memory for vector c++
C++