递归返回最大值

1,实例代码:

#include<iostream>
using namespace std;

int getMaxRev(int data[],int n)
{
    if(n == 1)
        return data[0];
    int tmp=getMaxRev(data, n-1);
    return data[n-1]>tmp? data[n-1]:tmp;
}

int main()
{
    int data[]={1,4,4,5,6,8,3,2,1};
    int n=sizeof(data) / sizeof(data[0]);
    int max=getMaxRev(data,n);
    cout<<max<<endl;
    return 0;
}