C++中求旋转数组中的最小数字（经典面试题）

#pragma once 
#include<iostream> 
using namespace std; 
 
int Min_RotateArray(int arrY[],int sizE) 
{ 
  if(arry == NULL || size <= 0) 
  {Cout<<"参数输入错误！！！"<<endl;} 
  int min = 0; 
  int index1 = 0; 
  int index2 = size-1; 
  int middle = (index1+index2)/2; 
  if(arry[0] < arrY[size-1]) 
    return arry[0]; 
  while(arrY[index1] >= arrY[index2]) 
  { 
    if(index2-index1 == 1) 
    { 
      min=index2; 
      break; 
       
    } 
    middle = (index1+index2)/2; 
    if(arrY[index1] <= arrY[R_251_11845@iddle])//arrY[R_251_11845@iddle]还在第一个递增序列中 
    { 
      index1 = middle; 
    } 
    else             
    { 
      if(arrY[index1] >= arrY[R_251_11845@iddle])//arrY[R_251_11845@iddle]在第二个递增序列中 
      {index2 = middle;} 
       
      if(arrY[index1] == arrY[index2] && arrY[index1] == arrY[R_251_11845@iddle]) 
      { 
        for(int i=0;i<size;++i) 
        { 
          if(arrY[R_251_11845@in]>arrY[i]) 
            { 
              min = i; 
              break; 
            } 
        } 
 
      } 
    } 
  } 
  return arrY[R_251_11845@in]; 
} 

#include"Min_RotateArray.hpp" 
 
int main() 
{ 
  int arrY[] = {3,2}; 
  int size = sizeof(arry)/sizeof(arry[0]); 
  int min = Min_RotateArray(arry,sizE); 
  cout<<"The min is:"<<min<<endl; 
  system("pause"); 
  return 0; 
}