剑指offer-面试题8.旋转数组的最小数字

#include <iostream>
using namespace std;

int Min(int* nums,int length)
{
int left=0;
int right=length-1;
int mid;
while((right-left)!=1)
{
mid=(left+right)/2;
if(nums[mid]>nums[left])
{
left=mid;
}
if(nums[mid]<nums[right])
{
right=mid;
}
}
return nums[right];
}

int main()
{

int nums[10]={6,7,8,9,10,1,2,3,4,5};
int numsSize=10;
int minnumber;
minnumber=Min(nums,numsSize);
cout<<"The min number of array is: "<<minnumber<<endl;
return 0;
}