PPT Slide

public class Primes {

public static void main (String arg[ ]) {

int MAX = 100;

boolean[ ] bPrime = new boolean[MAX];

bPrime[1] = false;

/* set all candidates to true */

for (int i=2; i< MAX; i++)

bPrime[i] = true;

/* set to false all multiples of the counters */

for (int I = 2; I < MAX/2; i++)

for (int j = 2; j < MAX/i; j++)

bPrime[i* j]=false;

/* print results */

for (int i=1; i<MAX-1; i++)

if (bPrime[i])

System.out.println (i + " is prime");

} // main

} // class Primes

Note:

Here, the important

information is stored

as the index value of

the array; we don’t place

numbers in the

array itself.

Previous slide

Next slide

Back to first slide

View graphic version