Sieve of Eratosthenes

Generating primes

Given an integer $N$, you are asked to print all the prime numbers between $1$ and $N$.

Using what we have discussed so far, one way to do this would be to iterate over all the numbers from $1$ to $N$ and check if it’s prime or not.

Time Complexity - $O(N*\sqrt{N}).$

It should be okay for $N$ up to ...