Find Prime Elements

Given an array from user the task is to print all the Prime Numbers present in the array.

Example:

Consider an array of size 5.

26437

Prime Numbers in the array are: 2 3 7

C
#include <stdio.h>
int main()
{
    int n,flag=0;
    printf("Enter the size of array: ");
    scanf ("%d", &n);
    int ar[n];
    printf("Enter the array elements:-\n");
    for(int i=0;i<n;i++)
    {
        scanf("%d",&ar[i]);
    }
    printf("Prime Numbers in the array: ");
    for(int i=0;i<n;i++)
    {
        flag=0;
        for (int j=2;j<ar[i];j++)
        {
            if(ar[i]%j==0)
            {
                flag=1;
                break;
            }
        }
        if(flag==0 && ar[i]!=1)
        {
            printf("%d ",ar[i]);
        }
    }
    return 0;
}
C