分治：旋转数组找最小元素

Suppose an array sorted in ascending order is rotated at some pivot unknown to you be- forehand. (i.e., [0, 1, 2, 4, 5, 6, 7] is an ascending array, then it might be rotated and become [4, 5, 6, 7, 0, 1, 2].) How to find the minimum of a rotated sorted array?

(Hint: All elements in the array are distinct.)

For example, the minimum of the rotated sorted array [4, 5, 6, 7, 0, 1, 2] is 0.

Please give an algorithm with O(logn) complexity, prove the correctness and analyze the complexity.

#include<iostream>
#include<algorithm>
using namespace std;
int find_array(int B[],int left,int right)
{
    int i=left;
    int j=right;
    int mid=(i+j)/2;
    if(j-i==1)
        return min(B[i],B[j]);
    else
    {
        if(B[j]>B[mid])
            return find_array(B,i,mid);
        else
            return find_array(B,mid,j);
    }
}
int main()
{
    int n;
    cin>>n;
    int shuzu[n];
    for(int i=0;i<n;i++)
    {
        cin>>shuzu[i];
    }
    cout<<find_array(shuzu,0,n-1);
}