Find Max In Rotated Sorted Array (medium)

class Solution {
public:
    int findMin(vector<int>& nums) {

        int n = nums.size() - 1;
        if (nums[0] <= nums[n])
        {
            return nums[0];
        }

        int l = 0, r = n, m = 0;

        while(l <= r)
        {
            m = (l + r) / 2;
            if (nums[m] > nums[m + 1])
            {
                return nums[m + 1];
            }
            else if (nums[m] < nums[m - 1])
            {
                return nums[m];
            }
            else if (nums[m] > nums[r])
            {
                l = m + 1;
            }
            else if (nums[m] < nums[r])
            {
                r = m - 1;
            }
        }
        return nums[m];
    }
};

written by me - O(log n)