分治算法-最大值

#include<iostream>
using namespace std;

int maxnum(int a[],int low,int high)
{
    if(low==high)
        return a[low];
    else
    {
        int mid=(low+high)/2;
        int m1=maxnum(a,low,mid);
        int m2=maxnum(a,mid+1,high);
        return m1>m2?m1:m2;
    }
}
int main()
{
    int a[10]={3,5,7,1,2,9,8,11,10,4};
    cout<<maxnum(a,0,9)<<endl;
    return 0;
}