C++ Program to find sum of prime numbers in an array


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


List is: 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22

Sum of prime number is : 2 + 3 + 5 + 7 = 17


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

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

int main() {

    int arr[10], i, s, j, p, sum = 0;

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

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

    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) {
            sum = sum + arr[i];
        }
    }
    cout << "\nSum of Prime Numbers is :" << sum;

    return 0;
}

Output:

Enter Size of An Array :5
Enter Array Elements :4 5 6 7 8
Sum of Prime Numbers is :12