sankardevisharath / Sieve-of-Eratosthenes

Sieve of Eratosthenes algorithm finds prime numbers below a number N.

Sieve of Eratosthenes algorithm finds prime numbers below a certain number
N. This algorithm is fast and efficent. In this code i have implemented
algorithm at bitlevel. So my implementation of algorithm uses very less 
memory and time.