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 vote147 views1 answer
Glm has no member value_ptr
C++
1 vote165 views1 answer
C++ in linux
C++
0 vote188 views1 answer
C++ delete int
C++
0 vote182 views1 answer
Patterns in c++
C++
0 vote161 views1 answer
Tutti i tipi di equazioni trigonometriche
C++
-2 votes275 views4 answers
Function Template in c++
C++
0 vote155 views1 answer
Qrandomgenerator bounded
C++
12 votes182 views2 answers
C++ cast char to string
C++
1 vote153 views3 answers
Python ord()
C++
0 vote189 views1 answer
ViewController import
C++