Suppose a sorted array A is rotated at some pivot unknown to you beforehand.Problem Constraints
(i.e., 1 2 4 5 6 7 might become 4 5 6 7 1 2).
Find the minimum element.
The array will not contain duplicates.
Note:- Use the circular rotated property of the array to solve the problem.
1 <= len(A) <= 105Input Format
1 <= A[i] <= 109
The first argument is an Integer array A.Output Format
Return the minimum element of array A.Example Input
A = [7, 2, 4, 5]
A = [3, 1, 2]
2 is the minimum element in the aray.
1 is the minimum element in the array.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified.
Still have a question? Checkout Sample Codes for more details.