Sieve of Eratosthenes - Program to find all prime numbers smaller than a given number

Sieve of Eratosthenes is a very old algorithm to find all the prime numbers up to a given limit. For example, we can find all the prime numbers up to, say 101, using this algorithm in a very efficient manner. It does so by iteratively marking as comp...