binary_search.cpp

class Solution {
public:
    int search(vector<int>& nums, int target) {
        
        int low = 0;
        int high = nums.size();
  
 
        while(low<=high){
            int mid = (low+high)/2;
            if(mid == nums.size()){
                return -1;
            }
            if(nums[mid] == target){
                return mid;
            }
            
            if(nums[mid] > target){
                high = mid-1;
            }else{
                low = mid+1;
            }
            
        }
        
        return -1;
        
    }
};