On 6/5/07, Steinar H. Gunderson <[EMAIL PROTECTED]> wrote: > > On Tue, Jun 05, 2007 at 10:44:16AM -0400, Jon Strayer wrote: > > I'd have to say "no". The main loop of the sieve is an addition and an > > assignment. This thing has multiplications and powers. > > For Eratosthenes' sieve, the main problem quickly becomes memory bandwidth > anyhow, so multiplications would be generally worth it if fewer memory > accesses are made.
He's looping through the same list. Siebung (sieve) is called twice for each prime found. So I don't think there is any significant decrease in the bandwidth required. I'm going to have to code this up in Java and see what the results are. Maybe this weekend. /* Steinar */ > -- > Homepage: http://www.sesse.net/ > _______________________________________________ > Prime mailing list > [email protected] > http://hogranch.com/mailman/listinfo/prime > -- Esse Quam Videre To Be, rather than to Seem _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
