Find Minimum in Rotated Sorted Array Visualizer & Step-by-Step Algorithm Solution

Find the minimum element in a sorted rotated array in O(log n) time by comparing nums[mid] to nums[right].

Category: binary-search | Difficulty: Medium

Tags: Binary Search, Rotated Array, Inflection Point

Find Minimum in Rotated Sorted Array

nums (Rotated)
LEFT
3
0
4
1
5
2
1
3
RIGHT
2
4
100%
state
left0
right4
minValSearching
Initialization
1/11
Explanation

Start binary search for minimum element in rotated sorted array of length 5.

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