202401171003
tags: #binary-search

var findMin = function(nums) {
	let start = 0;
	let end = nums.length - 1;
	let target = nums[0];
	while (start <= end) {
		const mid = Math.floor((end - start) / 2) + start;
		if (nums[mid] <= nums[end]) {
			end = mid - 1;
		} else {
			start = mid + 1;
		}
		target = Math.min(target, nums[mid]);
	}
	return target;
};

Reference

https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/