递归求数组最大值

#include<stdio.h>  
#define N 10  
  
int sort(int arr[],int n)  
{  
    int max;  
    if(n==0)  
    {  
        return arr[0];  
    }  
    else  
    {  
        max=sort(arr,n-1);  
        if(max<arr[n-1])  
        {  
            max=arr[n-1];  
        }  
    }  
    return max;  
}  
int main()  
{  
    int arr[N]={1,2,3,4,50,6,7,8,9,10};  
    int max=sort(arr,N);  
    printf("max=%d\n",max);  
}  

猜你喜欢

转载自blog.csdn.net/inshixu/article/details/80154614