This algorithm finds prime numbers from 2 to n using sieve algorithm. Input is an integer n. Output is an array. Array contains  zeros and numbers. Every number other than zero is a prime number.
 

The Algorithm