Question: 153. Find Minimum in Rotated Sorted Array

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution:

class Solution {
    public int findMin(int[] nums) {
       int low = 0;
       int high = nums.length - 1;
       while(low < high) {
        int mid = low + (high - low) / 2;
        if (nums[mid] > nums[high]) low = mid + 1;
        else if (nums[low] < nums[mid]) high = mid - 1;
        else high = mid;
       }
       return nums[high];
    }
}