利用递归求n个数中的最大数

#include <stdio.h>
int main()
{
int max(int x, int y);
int Rand_Num[100]={0,1,2,3,4,5,6,7,8,9,10}, Size=10;
int Num;
for(int i=0;i<Size;i++)
Num=max(Rand_Num[i],Rand_Num[i+1]);
printf("Max Num is:%d\n",Num);

return 0;
}
int max(int x, int y)
{
int z;
z = x > y ? x : y;
return z;
}

#include <stdio.h>
int main()
{
int max(int x, int y);
int Rand_Num[100]={0,1,2,3,4,5,6,7,8,9,10}, Size=10;
int Num;
for(int i=0;i<Size;i++)
Num=Rand_Num[i] >Rand_Num[i+1] ? Rand_Num[i] : Rand_Num[i+1];
printf("Max Num is:%d\n",Num);

return 0;
}

// 递归求a[i]~a[j]中的最大值
int max(int *a,int i, int j)
{
if(i==j)
return a[i];

int temp;
temp=max(a,i+1,j);
return a[i]>temp?a[i]:temp;
}

#include <stdio.h>
in