Find Minimum in Rotated Sorted Array- 153

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