Solving Find Minimum in Rotated Sorted Array in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

Find the minimum element.

You may assume no duplicate exists in the array.

Example 1:

Input: [3,4,5,1,2] 
Output: 1

Example 2:

Input: [4,5,6,7,0,1,2]
Output: 0

See the full details of the problem Find Minimum in Rotated Sorted Array at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go