import java.util.ArrayList;
public class Solution {
    public int minNumberInRotateArray(int [] array) {
        return minNumberInRotateArrayDg(array,0,array.length-1);
    }

    public int minNumberInRotateArrayDg(int [] array,int s,int e) {
        if(s>=e){
            return array[s];
        }
        int c = (e-s)/2 + s;
        return Math.min(minNumberInRotateArrayDg(array,s,c),minNumberInRotateArrayDg(array,c+1,e));
    }
}