/*
递归法返回一个数组中的最大值
*/
#include<stdio.h>
int maxValue(int array[],int n)
{
if(n == 1)
return array[0];
if(array[0] >= maxValue(array+1,n-1))
return array[0];
else
return maxValue(array+1,n-1);
}
int main()
{
int array[] = {1,14,13,5,6,7,14};
int max = maxValue(array,7);
printf("the max value of array is :%d\n",max);
int array2[] = {2,2,2,2,2,2};
int max2 = maxValue(array2,6);
printf("the max value of array2 is :%d\n",max2);
int array3[] = {6,5,4,3,2,1};
int max3 = maxValue(array3,6);
printf("the max value of array3 is :%d\n",max3);
return 1;
}