// Find Minimum in Rotated Sorted Array — MEDIUM

// Category: binary-search

Suppose a sorted array of unique elements has been **rotated** at some pivot. For example, `[0,1,2,4,5,6,7]` might become `[4,5,6,7,0,1,2]`.

Given such an array `nums`, return the **minimum element**.

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

Example: nums = [3, 4, 5, 1, 2]

Output: 1