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

24 votes309 views5 answers
Install heroku
C++
0 vote324 views1 answer
"StepFileGen1." cpp.o failed jetson nano
C++
0 vote340 views1 answer
Txt auslesen c++
C++
0 vote324 views2 answers
How to create array with not constant size in cpp
C++
0 vote309 views1 answer
Could not find the task c c++ active file
C++
0 vote323 views1 answer
Use uint in c++
C++
2 votes324 views2 answers
C++ back()
C++
0 vote299 views1 answer
Fractional Knapsack problem
C++
0 vote312 views2 answers
C++ function for checking if a sting is a number
C++
51 votes375 views3 answers
Phph date
C++