Leetcode 153. Find Minimum in Rotated Sorted Array

Given an ascending array of unique integers that has been rotated, find its minimum element in O(log n) time by identifying the rotation pivot using a binary-search-like approach.