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 vote110 views1 answer
How to turn an integer variable into a char c++
C++
0 vote117 views1 answer
Nike
C++
0 vote72 views1 answer
How to print hex of char c++
C++
0 vote121 views1 answer
Ubuntu dotnet create blazorserver linux
C++
0 vote113 views1 answer
Concatenate string along with the size of the word. in c++
C++
1 vote113 views1 answer
Get first element of tuple c++
C++
0 vote105 views1 answer
Ue4 c++ add tag
C++
0 vote65 views1 answer
Sort deque in c++
C++
-2 votes118 views4 answers
Memset function in C++
C++
0 vote127 views1 answer
Fabs c c++
C++