C Program to Find prime numbers in an array using function

C Program to Find prime numbers in an array using function, find Prime Numbers from array, given array find prime numbers, Prime Number calculation from array

#include
int prime(int n)
{
int i,flag=1;
for(i=2;i<=n/2;i++)
{
if(n%i==0)
{
flag=0;
break;
}
}
return flag;
}

main()
{
int arr[50],l,i,count=0;
printf(“Enter number of elementsn”);
scanf(“%d”,&l);
printf(“Enter %d numbersn”,l);
for(i=0;i<l;i++)
{
scanf(“%d”,&arr[i]);
}
for(i=0;i<l;i++)
{
if(prime(arr[i])==1)
count++;
}
if(count==0)
{
printf(“There are no prime numbers in the listn”);
}
else
{
printf(“There are %d prime number(s) in the listn”,count);
for(i=0;i<l;i++)
{
if(prime(arr[i])==1)
printf(“%dn”,arr[i]);
}
}
}