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

0 vote112 views1 answer
Parenthesis Checker using stack in c++
C++
0 vote125 views1 answer
Mkdir boost filesystem
C++
7 votes118 views1 answer
Migration meaning
C++
0 vote174 views1 answer
Upcasting in c++
C++
0 vote116 views1 answer
Balanced brackets in c++
C++
2 votes134 views2 answers
Sieve of eratosthenes c++
C++
0 vote113 views1 answer
How to save system function output into a variable in c++
C++
19 votes138 views1 answer
How to output to a file in c++
C++
1 vote132 views1 answer
Elixir update map
C++
1 vote123 views1 answer
Ue4 find component c++
C++