Find Prime Elements

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

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=0,flag=0;
    printf("Enter the size of array: ");
    scanf("%d", &n);
    int ar[n];
    int *p=ar;
    printf("Enter the array elements:\n");
    for(int i=0;i<n;i++)
    {
        scanf("%d",p);
        p++;
    }
    p=ar;
    printf("Prime Numbers in the Array: ");
    for(int i=0;i<n;i++)
    {
        for(int j=1;j<=*p;j++)
        {
            if(*p%j==0)
            {
                flag++;
            }
        }
        if(flag==2)
        {
            printf("%d ",*p);
        }
        flag=0;
        p++;
    }
    return 0;
}
C