Advertisement
MeShootIn

Left binary search

Jul 17th, 2019
99
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.29 KB | None | 0 0
  1. int bisection_search(vector <int> & arr, int left, int right, int key){
  2.     int mid;
  3.    
  4.     while(left < right){
  5.         mid = (left + right) / 2;
  6.        
  7.         if(key <= arr[mid]){
  8.             right = mid;
  9.         }
  10.         else{
  11.             left = mid + 1;
  12.         }
  13.     }
  14.    
  15.     if(arr[right] == key){
  16.         return right;
  17.     }
  18.    
  19.     return -1;
  20. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement