旋转数组的最小数字

旋转数组的概念：把一个数组最开始的若干个元素搬到数组的末尾，我们称为数组的旋转。例如{3,4,5,1,2}为{1,2,3,4,5}的一个旋转，该数组的最小值为1。

#include<iostream>
using namespace std;

int MinNum(int* numbers, int length)
 {
     if(numbers == NULL || length <= 0)
     {
         cout<<"invalid input" <<endl;
         exit(-1)    ;
    }

     int start = 0 ;
     int end = length - 1;
     int middle = start;

     while(numbers[start] >= numbers[end])
     {
         if(end -start == 1)
         {
             middle = end;
             break;
         }

         middle = (start + end) / 2 ;

         if(numbers[start] == numbers[end] && numbers[middle] == numbers[start])
         {
             int result = numbers[start];
             for(int i = start + 1; i<= end ; ++i)
             {
                 if(numbers[i] < result)
                     result = numbers[i];
             }
             return result;
         }

         if(numbers[middle] >= numbers[start])
             start = middle;
         else if(numbers[middle] <= numbers[end])
             end = middle;
     }

     return numbers[middle];
 }

 int main()
 {
     int array[] = {1, 0, 1, 1, 1};
     int length = sizeof(array)/ sizeof(int);

     int minNum = MinNum(array, length);

     cout << "最小的数的值: " << minNum << endl;

     return 0;
 }