LeetCode Find Minimum in Rotated Sorted Array II a short one

LeetCode Find Minimum in Rotated Sorted Array II a short one

class Solution {

public:

    int search(vector<int>& nums,int l,int r)

    {

        if(l>r)

          return INT_MAX;

        else if(l==r)

          return nums[l];

        else if(nums[l]<nums[r])

          return nums[l];

        int mid=(l+r)/2;

        return min(search(nums,l,mid),search(nums,mid+1,r));

    }

    int findMin(vector<int>& nums) {

        return search(nums,0,nums.size()-1);

    }

};