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 vote116 views1 answer
Prime number generator c++
C++
0 vote106 views1 answer
Program To Calculate Number Power Using Recursion In C++. The power number should always be positive integer.
C++
0 vote104 views1 answer
Generate random double c++
C++
1 vote106 views1 answer
Leveling system c++
C++
0 vote100 views1 answer
Max two numbers c++
C++
-1 vote111 views1 answer
Templates of templates c++
C++
0 vote103 views1 answer
. The cout with the insertion operator (<<) is used to print a statement
C++
0 vote106 views1 answer
Check if a string is a prefix of another c++
C++
0 vote101 views1 answer
Transpose function example in c++
C++
5 votes117 views10 answers
Array
C++