Path: csiph.com!news.mixmin.net!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Tim Rentsch
Newsgroups: comp.lang.c++
Subject: Re: Sieve of Eratosthenes
Date: Mon, 28 Aug 2023 15:15:17 -0700
Organization: A noiseless patient Spider
Lines: 9
Message-ID: <861qfmyft6.fsf@linuxsc.com>
References: <86msyq5rqu.fsf@linuxsc.com> <56146f63-17d7-40cc-8c42-4f29c922a8c4n@googlegroups.com> <874jkknizq.fsf@bsb.me.uk>
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Injection-Info: dont-email.me; posting-host="1084eb5dd0b1a11121af7ba127734067"; logging-data="1985633"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18EEu6l5UExzu4UTbzKBzTi4mK67yTzheI="
User-Agent: Gnus/5.11 (Gnus v5.11) Emacs/22.4 (gnu/linux)
Cancel-Lock: sha1:3+jCKJDKLJv6IJTF9NqIJyERArs= sha1:DNhGI6uyLklZCj3EIIfqfI7KAWs=
Xref: csiph.com comp.lang.c++:91463
Ben Bacarisse writes:
> I wanted to try a newer algorithm, so I coded up a rather naive
> version of Atkin & Bernstein's sieve in C. It needs some tidying
> and I imagine a bit can be shaved off the time.
Thank you for this. Would you mind posting your code? Also do
you have a reference for the Atkin/Bernstein algorithm (or even
better, code?)?