C# Program to find the sum of prime numbers in an array


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


List is : 3 4 5 6 7 => 3 + 5 + 7 = 1

Example: How to find the sum of prime numbers in an array in C#.

using System;
public class Program
{
	public static void Main(string[] args)
	{
		int i, j, p, s = 0;
		int[] arr = new int[5];

		Console.Write("Enter array elements:");
		for (i = 0; i < arr.Length; i++)
		{
			arr[i] = Convert.ToInt32(Console.ReadLine());
		}

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

			if (p == 1)
			{
				s = s + arr[i];
			}
		}
		Console.Write("Sum of prime numbers:" + s);
	}
}

Output:

Enter array elements:2
3
4
5
6
Sum of prime numbers:10

Xiith is created for educational, experimental, and schooling purpose. Examples on Xiith are made easier to make a better or basic understanding. Tutorials, testimonials, and examples are continuously checked to avoid delusion, but we cannot take complete responsibility of all programs on Xiith. When you are operating this site, you have to agree to read and accept our terms of use, cookie and privacy policy.Copyright © 2020 by Xiith. All Rights Reserved. About us.