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

9 votes269 views2 answers
Vector fin element c++
C++
1 vote282 views1 answer
C++ fizzbuzz
C++
11 votes302 views2 answers
Str remove char c++
C++
3 votes317 views2 answers
How to get last element of set
C++
0 vote265 views1 answer
C++ loop trhought object
C++
0 vote265 views1 answer
C++ rgb code
C++
0 vote298 views1 answer
C++ sort
C++
1 vote280 views2 answers
C++ last element of array
C++
0 vote277 views2 answers
C++ memory leak
C++
0 vote277 views1 answer
Oncomponentbeginoverlap ue4 c++
C++