面试题8:旋转数组的最小数字

public class Demo8 {
public int min(int[] array) throws Exception{
if(array == null)
{
throw new Exception("invalid");
}
int index1=0;
int index2=array.length-1;
int mid=index1;
while(array[index1] >= array[index2])
{
if(index2-index1 == 1)
{
mid=index2;
break;
}
mid=(index1+index2)/2;
if(array[mid] >= array[index1])
{
index1=mid;
}
else if(array[mid] <= array[index2])
{
index2=mid;
}
}
return array[mid];
}

public static void main(String[] args) throws Exception {
int arr[]=new int[]{6,7,8,2,3,4,5};
Demo8 demo=new Demo8();
int min=demo.min(arr);
System.out.println(min);
}

}