HSZ Java Test - Siebalgorithmus

Wiki-Quelltext dieser Seite.

<language>Java</language>
<run id="4dbd960ae69b8">
            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])
                {
                    println(i);
                    for (int j = i * i; j < n; j = j + i)
                        prime[j] = false;
                }
</run>