The sieve of Atkin is a modern algorithm, created in 2003 by A.O.L. Atkin and Daniel Bernstein, for finding all prime numbers up to a specified integer. Compared with the ancient sieve of Eratosthenes, which marks off multiples of primes, the sieve of Atkin does preliminary work and then marks off multiples of squares of primes, achieving a better theoretical asymptotic complexity.
Connections
Preceded By
Verified en.wikipedia.org/wiki/Sieve_of_Atkin: "Compared with the ancient sieve of Eratosthenes, which marks off multiples of primes, the sieve of Atkin does some preliminary work and then marks off multiples of squares of primes, thus achieving a better theoretical asymptotic complexity."
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.