Has anybody tried to do a prime number generator using the sieve of Atkin or Eratsothenes?

Question

anonymous · Answer

If you google sieve of erastothenes python, you can find a lot of examples.

anonymous · Answer

Thanks.  I have been looking. I think that writing a code for that is a lot harder than PS1

anonymous · Answer

I believe it is quite a bit harder. I looked at a few of the examples and they all require more code than my solution to ps1 did.

anonymous · Answer

I read a site somewhere a long time ago where a guy was comparing a bunch of different strategies for detecting primes, and it turned out the Sieve of Eratosthenes was the most efficient.

anonymous · Answer

Couldn't resist. http://codepad.org/MC906llY