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 vote313 views1 answer
C++ typeid get type name
C++
3 votes285 views2 answers
Lambda function in c++
C++
0 vote311 views1 answer
Changing key bindings in visual code not working
C++
1 vote287 views1 answer
Mpi_bcast
C++
-1 vote250 views1 answer
Dynamic 2d array c++
C++
0 vote335 views1 answer
Cpp pointer to two dimensional array
C++
2 votes279 views1 answer
How to interface c++ in haxe
C++
2 votes302 views2 answers
Char
C++
0 vote301 views1 answer
Prevent getting data from data-tooltip-content tippyjs
C++
0 vote287 views1 answer
Count spaces in string java
C++