Binary search return index c++

int binarySearch(vector<int>& arr, int p, int r, int num) {
        while (p <= r) {
            int mid = (p + r)/2;
            
            if (arr[mid] == num) return mid;
            else if (arr[mid] > num) r = mid-1;
            else  p = mid+1;
        }
        return -1;
    }

Similar codes

1 vote123 views3 answers
If c++
C++
2 votes123 views2 answers
C++ round number down
C++
-2 votes127 views1 answer
Computer vision libraries C++
C++
0 vote125 views2 answers
Check prime cpp gfg
C++
0 vote121 views1 answer
Setw in c++
C++
0 vote166 views1 answer
Check if float has decimals c++
C++
92 votes245 views6 answers
String reverse
C++
0 vote161 views2 answers
\0 in c++
C++
3 votes116 views1 answer
Set precision with fixed c++
C++
0 vote132 views1 answer
What is imposter syndrome
C++