旋转数组中的最小值（二分搜索实现）

#include<iostream>
using namespace std;
int find_min(int* nums, int l, int r)
{
int mid_loc = (l + r) / 2;
int new_l = l;
int new_r = r;
if (nums[mid_loc] >= nums[l])//new_l一定定位于前面的数组中的
new_l = mid_loc;
if (nums[mid_loc] <= nums[r])//new_r一定定位于后面的数组中
new_r = mid_loc;
if (new_r - new_l == 1)
return nums[new_r];
else
find_min(nums, new_l, new_r);
}
int main()
{
int n;
cout << "input n" << endl;
cin >> n;
int * nums=(int*)malloc(sizeof(int));
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
nums[i] = temp;
}
int min;
min = find_min(nums,0,n-1);
cout << "min=" << min;
return 0;
}