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