在旋转数组中查找某个数

源码如下：

//二分法:在旋转数组中查找某个数
int RotSearch(int a[],int tag,int low, int high)
{
if (low>high)
{
return -1;
}
int mid =(low+high)/2;
if(tag==a[low])
{
return low;
}

if(tag==a[mid])
{
while(mid!=0&&a[mid-1]==tag) mid--;
return mid;

}
else if(a[low]==a[mid])
{
for(int i=low;i<high;++i)
{
if(a[i]==tag)  return i;
}
return -1;
}


else if((tag<a[mid]&&a[mid]<a[low])||(a[mid]<a[low]&&a[low]<tag)||(a[low]<tag&&tag<a[mid]))
{
return RotSearch(a,tag,low,mid-1);
}

else 
{
return RotSearch(a,tag,mid+1,high);
}


}


void main()
{
int a[]={0,0,0,0,1,0,0,0,0,0,0};


for (int i=0;i<2;++i)
{
int b =RotSearch(a,i,0,10);
cout<<b<<endl;
}

system("pause");
}