openset/leetcode

Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
..
Failed to load latest commit information.
find_minimum_in_rotated_sorted_array.go
find_minimum_in_rotated_sorted_array_test.go

153. Find Minimum in Rotated Sorted Array (Medium)

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.

Example 1:

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

Example 2:

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

Related Topics

[Array] [Binary Search]

Hints

Hint 1 Array was originally in ascending order. Now that the array is rotated, there would be a point in the array where there is a small deflection from the increasing sequence. eg. The array would be something like [4, 5, 6, 7, 0, 1, 2].
Hint 2 You can divide the search space into two and see which direction to go. Can you think of an algorithm which has O(logN) search complexity?
Hint 3
1. All the elements to the left of inflection point > first element of the array.
2. All the elements to the right of inflection point < first element of the array.
You can’t perform that action at this time.