Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

40,026 questions

51,982 answers

573 users

How to find of all the prime numbers in an array with C#

1 Answer

0 votes
using System;

class Program
{
    static bool isPrime(int n) {
            if (n == 0) return false;
            if (n == 1) return false;
            for (int i = 2; i <= (int)Math.Sqrt(n); i++) {
                if (n % i == 0)
                    return false;
            }
            return true;
    }
    static void Main() {
        int[] arr = new int[] {4, 8, 5, 17, 9, 22, 21, 13, 18, 99};

        for (int i = 0; i < arr.Length; i++) {
            if (isPrime(arr[i])) {
                Console.WriteLine(arr[i]);
            }
        }
    }
}


/*
run:

5
17
13

*/

 



answered Oct 19, 2019 by avibootz
...