In this tutorial, I am going to discuss a very interesting problem find minimum in rotated sorted array.
Given an array which is sorted in ascending order is rotated at some unknown point. Write a code to find the minimum element in a sorted and rotated array.
You may assume no duplicate exists in the array.
For example:
Example 1:
Input: [6, 7, 8, 1, 2]
Output: 1
The minimum element in this sorted and rotated array is 1.
Example 2:
Input: [8, 9, 10, 1, 0, 1, 2]
Output: 0
In this example, the minimum element is 0.