/* Print all primes below 100, using the "Sieve of Eratosthenes" algorithm */
#include <console>

main()
    {
    const max_primes = 100
    new series[max_primes] = { true, ... }

    for (new i = 2; i < max_primes; ++i)
        if (series[i])
            {
            printf("%d ", i)
            /* filter all multiples of this "prime" from the list */
            for (new j = 2 * i; j < max_primes; j += i)
                series[j] = false
            }
    }
