find the biggest entry in an array(recurse)

#include<stdio.h>
//from the end
int cmp(int a,int b){
	return (a>b)?a:b;
}
int find(int a[],int n){                   //find the biggest in these n entries
	if(n==2) return cmp(a[0],a[1]);
	else{
		return cmp(find(a,n-1),a[n-1]);    //compare the last one and the left array. 
	}
}
int main(void){
	int n,a[200];
	int i;
	scanf("%d",&n);
	for(i=0;i<n;i++) scanf("%d",&a[i]);
	printf("%d",find(a,n));
}

#include<stdio.h>
//from the beginning
int cmp(int a,int b){
	return (a>b)?a:b;
}
int find(int a[],int n){            
	if(n==2) return cmp(a[0],a[1]);
	else{
		return cmp(a[0],find(a+1,n-1));      //a+1 get an array whose number is n-1
	}
}             

int main(void){
	int n,a[200];
	int i;
	scanf("%d",&n);
	for(i=0;i<n;i++) scanf("%d",&a[i]);
	printf("%d",find(a,n));
}

#include<stdio.h>
//without return.(use the pointer)
void find(int a[],int num,int *p,int n){
	if(num==n) return ;
	else{
		*p=((a[num]>*p)?a[num]:*p);    //this time:compare the temparary max and the new entry
		find(a,num+1,p,n);             //next time
	}
}

int main(void){
	int n,a[200];
	int i;
	scanf("%d",&n);
	for(i=0;i<n;i++) scanf("%d",&a[i]);
	int max=a[0];
	find(a,1,&max,n);
	printf("%d",max);
}