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 vote200 views1 answer
C++ random number generator uniform distribution
C++
0 vote168 views1 answer
Assert warning c++
C++
-1 vote127 views1 answer
I need to write an int function in which there are only cout statements and if I return 0/1 it prints them too.
C++
-1 vote135 views1 answer
Equal elements in two arrays in c++
C++
1 vote138 views1 answer
Cuda dim3
C++
30 votes153 views5 answers
Remove value from vector c++
C++
1 vote132 views1 answer
Leveling system c++
C++
0 vote130 views1 answer
Convert vector into array c++
C++
0 vote120 views1 answer
Less than operator overloading in c++
C++
0 vote135 views1 answer
Argument to number C++
C++