Sieve of Eratosthenes
A classic algorithm for finding all prime numbers up to a given limit by iteratively marking multiples of each prime.
The Sieve of Eratosthenes is a method for finding prime numbers devised by the ancient Greek mathematician Eratosthenes.
I implemented the Sieve of Eratosthenes in my programming class.