Find Minimum in Rotated Sorted Array

1public int findMin(int[] nums) {
2    int left = 0;
3    int right = nums.length - 1;
4
5    while (left < right) {
6        int mid = (left + right) / 2;
7
8        if (nums[mid] > nums[right]) {
9            left = mid + 1;
10        } else {
11            right = mid;
12        }
13    }
14
15    return nums[left];
16}