Prime Sieve of Eratosthenes.cpp

This version of the sieve stores all the numbers of sieve. But uses slightly more memory as opposed to a bit array of size n.

There is a faster way to get primes using a bitset and taking only odd numbers in the sieve.