81. Search in Rotated Sorted Array II

class Solution {
public:
    bool search(vector<int>& nums, int target) {
        sort(nums.begin(),nums.end());
        int s=0;
        int e=nums.size()-1;
        int mid = s + (e-s)/2;
        while(s<=e)
        {
            if(nums[mid]==target)
            {
                return true;
            }
            else if(target < nums[mid]) 
            {
                //search in left
                e = mid - 1;
            }
            else 
            {
                //search in right
                s = mid + 1;
            }
            mid = s + (e-s)/2;
        }
        return false;
    }
};