HSZ Java Test - Siebalgorithmus

Aus ProgrammingWiki

Archivierte Version vom 2011-05-01T17:21:57+00:00. Aktuelle Version

int n = 300000;
            boolean[] prime = new boolean[n];
            for (int i = 2; i < n; i++)
                prime[i] = true;
 
            for (int i = 2; i < n; i++)
                if (prime[i])
                {
                    print(i)+" ";
                    for (int j = i * i; j < n; j = j + i)
                        prime[j] = false;
                }

HSZ Java Test - Siebalgorithmus

Suche