Binary search c++

int binarySearch(int arr[], int l, int r, int x)
{
    if (r >= l) {
        int mid = l + (r - l) / 2;
        if (arr[mid] == x)
            return mid;
        if (arr[mid] > x)
            return binarySearch(arr, l, mid - 1, x);
        return binarySearch(arr, mid + 1, r, x);
    }
    return -1;
}

Source: google.com

Similar codes

-1 vote122 views1 answer
How to insert all values from one vector to another
C++
5 votes167 views6 answers
While loop in c++
C++
36 votes175 views2 answers
Remove at index vector c++
C++
30 votes124 views10 answers
While loop c++
C++
0 vote181 views1 answer
Tutti i tipi di equazioni trigonometriche
C++
1 vote171 views1 answer
Pyramid shape in c++
C++
0 vote187 views3 answers
C++ splitstring example
C++
2 votes165 views3 answers
C++ string find last number
C++
0 vote171 views1 answer
Srand() c++
C++
0 vote154 views7 answers
C++ convert to c online
C++