递归求最值，有错求解
[code=C/C++][/code]
#include <stdio.h>
int max(int a[],int n)
{
int Max;
if(n==0)
return Max;
else
Max=a[n-1]>Max?a[n-1]:Max;
max(a,n-1);
}
int min(int a[],int n)
{
int Min=356;
if(n==0)
return Min;
else
Min=a[n-1]<Min?a[n-1]:Min;
min(a,n-1);
}
void main()
{
int i,n,a[30];
printf("please number n:\n");
scanf("%d",&n);
printf("please enter n int number:\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("The max Number is %d\n",max(a,n));
printf("The min Number is %d\n",min(a,n));
getch();
}
[解决办法]
