LEETCODE :Find Minimum in Rotated Sorted Array
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
Find the minimum element.
You may assume no duplicate exists in the array.
I HAVE SOLVED IT USING BINARY SEARCH
TIME COMPLEXITY : O( log(n) )
If you want to look at one more problem related to Binary Search, click
• LEETCODE : Leftmost Column with at Least a...
#binary_search #rotated_sorted_array