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

3 votes150 views5 answers
Round double to 2 decimal places c++
C++
0 vote155 views1 answer
Fstring from float c++ ue4
C++
1 vote139 views1 answer
How to iterate throguh a string in c++
C++
0 vote145 views1 answer
Square gcode
C++
1 vote147 views1 answer
Gfg cyclic array rotation
C++
1 vote159 views1 answer
Avrational compare
C++
0 vote144 views1 answer
C++ find with predicat
C++
8 votes167 views1 answer
Remove or erase first and last character of string c++
C++
0 vote153 views1 answer
If(arr[i]==k) return arr[i];
C++
0 vote147 views1 answer
Sort function from bigest to smallest c++
C++