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 vote294 views1 answer
C++ set console title
C++
1 vote311 views1 answer
Qt design editor hide window bottom white bar
C++
4 votes338 views2 answers
Double max value c++
C++
11 votes312 views2 answers
Str remove char c++
C++
0 vote292 views1 answer
Extra parameter in comparator function for sort
C++
0 vote330 views1 answer
How to get the numbers in a vector c++ sfml
C++
0 vote285 views1 answer
Declare a tab c++
C++
1 vote296 views2 answers
C++ last element of array
C++
0 vote271 views1 answer
Std::ofstream file1(FILE_NAME, std::ios::app);
C++
34 votes256 views6 answers
C++ string to int
C++