2 // Primzahlen sieben, Java-Version
6 static void sievenumber(int n, boolean[] no_prime, int p) {
8 for (i=p*2; i<=n; i+=p) no_prime[i] = true;
11 static void sieving(int n, boolean[] no_prime) {
13 for (p=2; p<=n; p++) {
14 if (!no_prime[p]) sievenumber(n,no_prime,p);
18 static public void main(String [] s) {
23 int n = Integer.parseInt (s[0]);
24 int times = Integer.parseInt (s[1]);
26 boolean no_prime[] = new boolean[n+1];
28 System.out.print ("Start sieving primes from 2 to ");
30 System.out.print (" for ");
31 System.out.print (times);
32 System.out.println (" times");
34 for (; times>0; times--) {
35 for (p=0; p<n+1; p++) no_prime[p] = false;
40 for (p=2; p<=n; p++) if (!no_prime[p]) count++;
44 System.out.print (".... done, number of primes: ");
45 System.out.println (count);