Find Minimum in Rotated Sorted Array

·#153·Medium·Binary Search

Rotated sorted array · binary search for minimum in O(log n)

Asked at:AmazonMicrosoft

Practice mode

Try your own input

Change the array and replay the algorithm from step one.

Step

Current step

Find minimum in rotated sorted array. If right half is sorted, min is in left (or mid). Otherwise min is in right.

Array workspace

Binary Search

Step 1 / 8init

100%

[0]

[1]

[2]

[3]

[4]

step 1 / 8

Space play← → stepHome reset

Binary Search

1function findMin(nums) {//left: 0right: 4
2  let left = 0, right = nums.length - 1;
3  while (left < right) {
4    const mid = Math.floor((left + right) / 2);
5    if (nums[mid] > nums[right]) {
6      left = mid + 1;
7    } else {
8      right = mid;
9    }
10  }
11  return nums[left];
12}

left0

right4

Command Palette

Find Minimum in Rotated Sorted Array

Find Minimum in Rotated Sorted Array