Binary_Search.cpp

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