7-Line O(LogN) Solution
public int FindMin(int[] nums) {\n        int left = 0, right = nums.Length - 1, mid = 0;\n        while(left < right){\n            mid = (left + right) >> 1;\
    public int FindMin(int[] nums) {\n        int left = 0, right = nums.Length - 1, mid = 0;\n        while(left < right){\n            mid = (left + right) >> 1;\n            if(nums[mid] > nums[right]) left = mid + 1;\n            else right = mid;\n        }\n        return nums[right];\n    }
['Divide and Conquer']