HSZ Processing test ij 1

Aus ProgrammingWiki

Archivierte Version vom 2011-05-02T10:30:26+00:00. Aktuelle Version

public void test()
{
            int n = 1000;
            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;
                }
}

test();

HSZ Processing test ij 1

Suche