HSZ Java Test - Siebalgorithmus

Wiki-Quelltext dieser Seite.

<language>Java</language>
<code id="4dbdb47732615">
public void era_sieve()
{            
int n = 30000;
            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;
                }
}
</code>            
<run id="4dbdb4773267b">
era_sieve();
</run>