Find Minimum in Rotated Sorted Array

Moderate

0/80

Average time to solve is 10m

Contributed by

142 upvotes

Asked in companies

Problem statement

You are given an array 'arr' of size 'n' having unique elements that has been sorted in ascending order and rotated between 1 and 'n' times which is unknown.

The rotation involves shifting every element to the right, with the last element moving to the first position. For example, if 'arr' = [1, 2, 3, 4] was rotated one time, it would become [4, 1, 2, 3].

Your task is to find the minimum number in this array.

Note :

All the elements in the array are distinct.

Example :

Input: arr = [3,4,5,1,2]

Output: 1

Explanation: The original array was [1,2,3,4,5] and it was rotated 3 times.

Detailed explanation ( Input/output format, Notes, Images )

Input Format :

The first line contains an integer 'n', the size of the array.
The second line contains 'n' space-separated integers.

Output Format :

The only line contains the minimum number in the given array.

Note :

You don’t need to print anything; It has already been taken care of. Just implement the given function.

Sample Input 1 :

4
3 4 1 2

Sample Output 1 :

Explanation of Sample Input 1 :

The original array was [1, 2, 3, 4] and it was rotated 2 times.

Sample Input 2 :

6
25 30 5 10 15 20

Sample Output 2 :

Explanation of Sample Input 2 :

The original array was [5, 10, 15, 20, 25, 30] and it was rotated 2 times.

Expected Time Complexity:

Try to solve this with O(log(n)) time complexity.

Constraints :

1 <= n <= 10^5
1 <= arr[i] <= 10^9

Time Limit: 1 sec

Console