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 vote198 views1 answer
Directed graph in cpp
C++
0 vote234 views1 answer
C++ program transpose of matrix
C++
4 votes224 views1 answer
Deep copy c++
C++
5 votes193 views3 answers
Cpp random number in range
C++
1 vote217 views3 answers
Reverse string c++
C++
0 vote183 views1 answer
How to check sqrt of number is integer c++
C++
0 vote184 views1 answer
Query for rmq using sqrt decomposition
C++
0 vote182 views1 answer
Test3
C++
0 vote137 views1 answer
C++ code executio canntot proceed because glew32.dll was not founud
C++
0 vote241 views1 answer
Std distance
C++