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 vote107 views1 answer
How to have a queue as a parameter in c++
C++
0 vote100 views1 answer
Dynamic memory in c++
C++
1 vote108 views1 answer
Forward declaration c++
C++
-1 vote111 views1 answer
Iterate over a range in c++
C++
0 vote102 views1 answer
Ampersand in cpp
C++
1 vote114 views1 answer
C++ keyboard input
C++
0 vote78 views1 answer
Glut keyboard input
C++
4 votes113 views3 answers
GCD in cpp
C++
-1 vote109 views1 answer
How to Append to Strings
C++
0 vote106 views1 answer
How to find product of a given numbers in c++
C++