Write a Program to Find prime numbers from an array and print it count.
#include<stdio.h> #include<stdlib.h> int Check_for_Prime(int n); enum Num_Status{IS_PRIME,IS_NOT_PRIME}; int main() { int IntArray[10],TotalArrayElements; int Index,PrimeCount; TotalArrayElements = sizeof(IntArray)/sizeof(IntArray[0]); printf("Enter %d Elements\n",TotalArrayElements); for(Index = 0;Index < TotalArrayElements;Index++) { scanf("%d",&IntArray[Index]); } printf("\nValues are"); for(Index = 0;Index < TotalArrayElements;Index++) { printf("\nIntArray[%d] = %d",Index,IntArray[Index]); } printf("\n"); PrimeCount = 0; printf("Prime numbers are\n"); for(Index = 0;Index < TotalArrayElements;Index++) { if(IS_PRIME == (Check_for_Prime(IntArray[Index]))) { PrimeCount++; printf("%d ",IntArray[Index]); } } printf("\nTotal prime numbers in an array = %d\n",PrimeCount++); return 0; } int Check_for_Prime(int n) { int i; for(i = 2;i < n; i++) { if(n%i == 0) break; } if(i == n) return IS_PRIME; else return IS_NOT_PRIME; }
Output
Enter 10 Elements 17 19 21 35 39 27 131 159 21 43 Values are IntArray[0] = 17 IntArray[1] = 19 IntArray[2] = 21 IntArray[3] = 35 IntArray[4] = 39 IntArray[5] = 27 IntArray[6] = 131 IntArray[7] = 159 IntArray[8] = 21 IntArray[9] = 43 Prime numbers are 17 19 131 43 Total prime numbers in an array = 4