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

0 vote289 views1 answer
Insertion overloading in c++
C++
1 vote317 views1 answer
Priority queue ordered by second element
C++
2 votes257 views1 answer
C++ get filename from path
C++
2 votes263 views1 answer
Suppress individual warnings in visual c++
C++
0 vote269 views1 answer
Read large files part by part in C++
C++
0 vote272 views1 answer
How can I replace a pattern from string in c++
C++
0 vote285 views1 answer
Wap in c++ to understand function template
C++
0 vote278 views1 answer
Cout hex c++
C++
0 vote241 views9 answers
Convert c++ to python online
C++
0 vote262 views1 answer
How to point to next array using pointer c++
C++