How do you write a program to read a value and display all prime numbers up to the value?

Answer 1

#include
#include

bool is_prime(unsigned num) {
unsigned max, factor;
if (num<2) return false;
if (!(num%2)) return num==2;
max = (unsigned) sqrt((double)num) + 1.0;
for (factor=3; factorif (!(num%factor)) return false;
return true;
}

int main() {

unsigned num;

for (num=1; num<=200; ++num)

if (is_prime(num)) printf ("%u is prime\n", num);

return 0;

}

Answer 2

Implement these methods in JAVA, perhaps with minor changes to primes():

public static void primes() {

for(int i = START; i <= END; i++) {

if(prime(i))

System.out.print(i + ", ");

}

System.out.println();

}

public static boolean prime(int n) {

if(n < 2) return false;

if(n 0) return false;

return true;

}

Answer 3

How do Iwrite a Program that prints all prime numbers from an array?

Answer 4

You can loop through the array. In Java, this might look like this:

for (i = 0; i <= myArray.length(); i++) {

System.out.println(myArray[i]);

}