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 vote232 views3 answers
For vector c++
C++
1 vote245 views1 answer
Qt window bottom bar
C++
0 vote223 views1 answer
Reverse Square Root
C++
2 votes208 views1 answer
Cannot find -lsqlite3 C++ compiler error
C++
4 votes247 views2 answers
Input pdf latex
C++
148 votes324 views10 answers
Grepper
C++
1 vote244 views2 answers
Read comma separated text file in c++
C++
1 vote217 views1 answer
Float in c++
C++
0 vote213 views1 answer
KUNG FU HUSTLE
C++
22 votes230 views6 answers
Sort array in descending order c++
C++