#include
using namespacestd;
int main()
{
int arr[] = {5,6,7,8,9,1,2,3,4};
int left = 0, right = 8;
cout<<"循环有序数组arr[]={";
for(int i = 0;
i < 9;
i++)
if(i != 8)
cout<> 1;
if(arr[left] < arr[right])
{
cout<<"最小值为:"< arr[mid])
{
right = mid - 1;
}
else if(arr[mid] > right)
{
left = mid + 1;
}
else
{
int minn = arr[left];
for(int i = left + 1;
i < right ;
i++)
if(arr[i] < minn)
{
minn = arr[i];
}
cout<<"最小值为:"< 【有序循环数组|二分查找--循环数组找最小值】
