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 vote113 views1 answer
Get index by pointer to element of vector c++
C++
0 vote126 views1 answer
Push_back a pair c++
C++
1 vote160 views2 answers
C++ inherit from class template
C++
0 vote122 views1 answer
Functors in c++
C++
0 vote122 views1 answer
. The cout with the insertion operator (<<) is used to print a statement
C++
1 vote124 views1 answer
Create n threads cpp
C++
0 vote104 views1 answer
Flag controlled while loop c++
C++
1 vote122 views4 answers
Sum vector c++
C++
0 vote119 views1 answer
C++ switch integer
C++
6 votes132 views4 answers
Int to qstring
C++