[Jprogramming] How can I get a list containing of every multiple of 2 less than or equal to 27?

[Terrence Brannon]

I'm sure many of you are suspecting that I am doing a naive implementation of
the Sieve of Eratosthenes - 
   http://shootout.alioth.debian.org/gp4/benchmark.php?test=nsievebits&lang=all

and you are correct. I think Roger's solution - 
    
http://www.jsoftware.com/jwiki/Essays/Primes_Less_Than_n?highlight=%28sieve%29

is optimized and hence not acceptable.



----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm