2 // Primzahlen sieben, Java-Version
4 public class intsieve {
6 static void sievenumber(int n, int[] no_prime, int p) {
8 for (i = p*2; i <= n; i += p)
12 static void sieving(int n, int[] no_prime) {
14 for (p = 2; p <= n; p++) {
15 if (no_prime[p] == 0) sievenumber(n, no_prime, p);
19 static public void main(String [] s) {
23 int n = Integer.parseInt (s[0]);
24 int times = Integer.parseInt (s[1]);
26 int no_prime[] = new int[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++)
41 for (p = 2; p <= n; p++)
42 if (no_prime[p] == 0) {
47 System.out.print (".... done, number of primes: ");
48 System.out.println (count);