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

7 votes132 views5 answers
Sleep c++
C++
0 vote121 views1 answer
Ask a question and answer it in code c++
C++
0 vote128 views1 answer
How to check if a number is prime c++
C++
0 vote215 views1 answer
Ind the number of digits of a given integer n .
C++
11 votes132 views2 answers
C++ get ascii value of char
C++
2 votes124 views2 answers
What s[i]-'0' does
C++
0 vote125 views1 answer
Cpp convert vector to set
C++
0 vote123 views1 answer
Sleep system function linux c++
C++
0 vote122 views3 answers
Bool function in c++
C++
0 vote128 views1 answer
16630147
C++