resort an array

#include<stdio.h>
void sort(int a[],int n){  // n---the number of entries which is not sorted.
	int t;
	if(n<=1)return ;
	else {
	//	t=*a;*a=*(a+n-1);*(a+n-1)=t;
		t=a[0];a[0]=a[n-1];a[n-1]=t;     //a[0] is the first entry of new array 
		sort(a+1,n-2);
	}
}
int main(void){
	int n,a[200];
	scanf("%d",&n);
	int i;
	for(i=0;i<n;i++)scanf("%d",&a[i]);
	sort(a,n); 
	for(i=0;i<n;i++){
		if(i!=0) printf(" ");
		printf("%d",a[i]);
	}
}

#include<stdio.h>
#define SIZE 4
void f(int a[],int n){              //n---position of the being operated entry 
	int t;
	if(n==((SIZE-1)/2))return ;
	else{
		t=a[n];a[n]=a[SIZE-1-n];a[SIZE-1-n]=t;
		f(a,n+1);
	}
}
int main(void){
	int a[]={3,5,3,6};
	int i;
	f(a,0);
	for(i=0;i<SIZE;i++){
		printf("%d ",a[i]);
	}
}

#include<stdio.h>
int find(int a[],int m,int n,int key){
	if(m==n) return -1;
	else{
		if(a[0]==key) return m;
		else return find(&a[1],m+1,n,key);
	}
}
int main(void){
	int i,a[200],n;
	scanf("%d",&n);
	for(i=0;i<n;i++) scanf("%d",&a[i]);
	int key;
	scanf("%d",&key);
	int flag=find(a,0,n,key);
	if(flag==-1) printf("NULL");
	else printf("%d",flag); 
} 

#include<stdio.h>
int find(int a[],int low,int up,int key){
	int mid=(up+low)/2;
	if(up<low) return -1;
	else if(a[mid]==key) return mid;
	else if(a[mid]<key) return find(a,mid+1,up,key);
	else if(a[mid]>key) return find(a,low,mid-1,key);
}
int main(void){
	int i,a[200],n;
	scanf("%d",&n);
	for(i=0;i<n;i++) scanf("%d",&a[i]);
	int key;
	scanf("%d",&key);
	printf("%d",find(a,0,n-1,key));
}