Back

Find Minimum in Rotated Sorted Array

medium

Suppose an array of length n sorted in ascending order is rotated between 1 and n times.

Given the sorted rotated array nums of unique elements, return the minimum element of this array.

You must write an algorithm that runs in O(log n) time.

Test Cases

Copy an input into the main harness and Run to verify
Input
nums = [3,4,5,1,2]
Expected Output
1
Input
nums = [4,5,6,7,0,1,2]
Expected Output
0
Input
nums = [11,13,15,17]
Expected Output
11

Constraints

  • n == nums.length
  • 1 <= n <= 5000
  • -5000 <= nums[i] <= 5000
  • All the integers of nums are unique.
  • nums is sorted and rotated between 1 and n times.

Hints

Hint 1 — click to reveal

If nums[mid] > nums[hi], the minimum must be to the right of mid.

Hint 2 — click to reveal

Otherwise the minimum is at mid or to the left.

Java Compiler

Powered by OneCompiler. Starter code loads automatically — edit and hit Run.