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

1 vote209 views1 answer
Roscpp publish int32
C++
0 vote193 views1 answer
Sum of n natural numbers in c
C++
1 vote202 views1 answer
Fiunction in c++
C++
0 vote214 views1 answer
Uint8_t in c++
C++
25 votes187 views5 answers
Getline in c++
C++
0 vote200 views1 answer
How to point to next array using pointer c++
C++
2 votes195 views1 answer
Get type of an object c++
C++
8 votes202 views4 answers
How to iterate through a map in c++
C++
35 votes217 views6 answers
Hello world cpp
C++
2 votes152 views1 answer
Ascii to char c++
C++