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

5 votes163 views1 answer
Qt debug
C++
0 vote165 views1 answer
Cpp loop through object
C++
0 vote160 views1 answer
Yearly interest calculator c++ using for loop
C++
0 vote153 views1 answer
System("pause") note working c++
C++
0 vote157 views1 answer
User inptu in cpp
C++
-1 vote153 views1 answer
Pointer to constant
C++
4 votes178 views2 answers
C++ stream string into fiel
C++
2 votes158 views1 answer
Dangling Pointer
C++
0 vote180 views1 answer
Get map values c++
C++
0 vote187 views1 answer
Cpp concatenate methods
C++