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 vote391 views1 answer
Use of strtok
C++
5 votes321 views3 answers
Remove space in string c++
C++
0 vote339 views1 answer
Typeid to string c++
C++
6 votes396 views3 answers
Print float up to 3 decimal places in c++
C++
3 votes392 views3 answers
C++ string contains
C++
1 vote398 views2 answers
Convert from hex to decimal c++
C++
4 votes373 views2 answers
Check uppercase c++
C++
3 votes419 views3 answers
Largest Subarray with Zero Sum
C++
5 votes350 views5 answers
How to convert char to int in c++
C++
1 vote322 views1 answer
C++ remove text file
C++