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 vote322 views1 answer
Ds1307 rtc set time
C++
3 votes310 views4 answers
C++ char array size
C++
0 vote294 views1 answer
C++ caps lock key
C++
0 vote353 views1 answer
Youtube backlink generator tool
C++
0 vote306 views1 answer
Txt to pdf CPP
C++
3 votes301 views3 answers
Find all occurrences of a substring in a string c++
C++
0 vote376 views3 answers
Simplest code for stack implementation in c++
C++
1 vote334 views1 answer
Cpp vector structure
C++
1 vote314 views1 answer
C++ product of vector
C++
12 votes301 views3 answers
Max element in array c++ stl
C++