旋转数组的最小值问题

#include <iostream>
using namespace std;

//旋转数组的最小数字 
int Min(int* numbers, int len)
{
	if(numbers==NULL || len<=0)
	{
		return -1;
	}
    
    int index1 = 0;
    int index2 = len-1;
    int indexMid = index1;
    while(numbers[index1] >= numbers[index2])
    {
    	if(index2-index1 == 1)
    	{
	    	indexMid = index2;
	    	break;
	    }
	    indexMid = (index1+index2)/2;
	    if(numbers[indexMid]>=numbers[index1])
	    {
    		index1 = indexMid;
    	}
    	else if(numbers[indexMid]<=numbers[index2])
    	{
	    	index2 = indexMid;
	    }
    }
    return indexMid;
}


int main()
{
    int a[] = {
    	7,8,9,10,2,3,4,5,6
    };
    cout << a[Min(a,9)] << endl;
    return 0;
}