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

5 votes103 views4 answers
Power in cpp
C++
0 vote134 views1 answer
How to read qlistwidget in c++
C++
0 vote109 views1 answer
1ll
C++
1 vote192 views1 answer
Kwakiutl tribe artifacts
C++
30 votes168 views5 answers
Remove value from vector c++
C++
2 votes138 views2 answers
Tolower funciton in cpp
C++
5 votes157 views2 answers
Delete specific row from dynamic 2d array c++
C++
0 vote139 views1 answer
Cmake g++ address sanitizer
C++
9 votes139 views3 answers
Log base c++
C++
25 votes151 views5 answers
Sort vector in descending order c++
C++