sieve of Eratosthenes Algorithm

One of a number of prime number sieves, it is one of the most efficient ways to find all of the smaller primes. The multiples of a given prime are generated as a sequence of numbers beginning from that prime, with constant difference between them that is equal to that prime.

sieve of Eratosthenes source code, pseudocode and analysis