C++ Program to find prime numbers in an array


In this program, You will learn how to find prime numbers in an array in C++.


Some list of prime numbers is: 2 3 5 7 11 13 17


Example: How to find prime numbers in an array in C++

Run it Now
#include<iostream>
using namespace std;

int main() {

    int arr[10], i, s, j, p;

    cout << "Enter Size of An Array :";
    cin>>s;

    cout << "\nEnter Array Elements :";
    for (i = 0; i < s; i++) {
        cin >> arr[i];
    }

    cout << "\nAll Prime List is :";

    for (i = 0; i < s; i++) {
        j = 2;
        p = 1;
        while (j < arr[i]) {
            if (arr[i] % j == 0) {
                p = 0;
                break;
            }
            j++;
        }
        if (p == 1) {
            cout << arr[i] << " ";
        }
    }

    return 0;
}

Output:

Enter Size of An Array :5
Enter Array Elements :3 5 6 7 8
All Prime List is :3 5 7