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

//把一个数组最开始的若干个元素搬到数组的末尾。eg:{3,4,5,1,2}是{1,2,3,4,5}的旋转数组

#include "stdafx.h"
#include <iostream>
using namespace std;
int MinInOrder(int data[],int index1,int index2);
int Min(int data[],int length)
{
    if(data==NULL||length<=0)
        throw new exception("Invalid Parameters:");

    int index1=0;
    int index2=length-1;
    int indexMid=index1;//tips1:
    while(data[index1]>=data[index2])
    {
        if(index2-index1==1)
        {
            indexMid=index2;
            break;
        }
        indexMid=(index1+index2)/2;

        //tips2:如果index1,index2,indexMid三者相同，就只能顺序查找
        if(data[index1]==data[index2]&&data[index1]==data[indexMid])
            return MinInOrder(data,index1,index2);
        if(data[indexMid]>=data[index1])
            index1=indexMid;
        else if(data[indexMid]<=data[index2])
            index2=indexMid;
    }
    return data[indexMid];
}

int MinInOrder(int data[],int index1,int index2)
{
    int result=data[index1];
    for(int i=index1+1;i<index2;i++)
    {
        if(result>data[i])
            result=data[i];
    }
    return result;
}


int _tmain(int argc, _TCHAR* argv[])
{
    int *data=NULL;
    //int data[1]={1};
    //int data[5]={1,2,3,4,5};
    //int data[5]={3,4,5,1,2};
    //int data[5]={1,1,1,0,1};
    cout<<Min(data,5)<<endl;
    return 0;
}