```
public class Solution {
public int findMin(int[] nums) {
return findMin(nums, 0, nums.length - 1);
}
private int findMin(int[] nums, int start, int end) {
if (start == end) {
return nums[start];
}
int mid = (start + end) / 2;
return Math.min(findMin(nums, start, mid), findMin(nums, mid + 1, end));
}
}
```