Linear Search using Recursion in C

#include<stdio.h>
int search(int[], int, int, int);
int main()
{
	int arr[50], size, i, key, found=0;
	
	printf("Enter length of elements : ");
	scanf("%d", &size);
	
	printf("Enter %d elements : \n", size);
	for(i=0 ; i<size ; i++)
	{
		scanf("%d", &arr[i]);
	}
	
	printf("Enter element to be searched :");
	scanf("%d", &key);
	
	found = search(arr, 0, size, key);
	if(!found)
		printf("Element not found \n");
	
	return 0;	
}
int search(int arr[], int cur, int end, int key)
{
	if(cur==end)
	{
		return 0;
	}
	if(key==arr[cur])
	{
		printf("Found @ loc : %d\n", cur);
		return 1;
	}
	search(arr, cur+1, end, key);
}