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

6 votes313 views4 answers
Map c++
C++
0 vote309 views1 answer
Powers of 2 in cpp
C++
2 votes310 views1 answer
Std string to const char * c++
C++
0 vote350 views1 answer
How to check if a number is prime c++
C++
2 votes304 views1 answer
How to complie with c++ 17
C++
1 vote319 views1 answer
Eosio check account exist
C++
0 vote350 views1 answer
Cpp pointer to two dimensional array
C++
0 vote324 views1 answer
Compile c++ MPI Program
C++
0 vote336 views1 answer
Bfs sudocode
C++
6 votes309 views9 answers
Preorder to postorder converter online
C++