Go Binary Search Solution
\nfunc findMin(nums []int) int {\n\tleft, right := 0, len(nums)-1\n\tfor left < right {\n\t\tmid := (left + right) / 2\n\t\tif nums[mid] > nums[right] {\n\t\t\t
```\nfunc findMin(nums []int) int {\n\tleft, right := 0, len(nums)-1\n\tfor left < right {\n\t\tmid := (left + right) / 2\n\t\tif nums[mid] > nums[right] {\n\t\t\tleft = mid + 1\n\t\t} else {\n\t\t\tright = mid\n\t\t}\n\t}\n\n\treturn nums[left]\n}\n```
['Go']