Re: The computational complexity of the Sieve of Eratosthenes

On May 1, 3:02 am, Juha Nieminen <nos...@xxxxxxxxxxxxxx> wrote:
user923005 wrote:
Using Daniel Bernstein's Primespeed.exe, which is an Aitken sieve

  I wasn't asking how fast it can be done. I was asking that if the
init() function in my example program was substituted with the sieve of
Atkin, how much faster it would be.

  If "anything goes as long as the bitset is initialized" I could just
create a 256-megabyte exe which takes 0.1 seconds (the time being only
dependent on how fast the system can load the exe from disk into
memory). But that was not my point.

Those functions perform initialization of the bitset. They do not
have the bitset pre-initialized.
.

Relevant Pages