Print all primes till n

are we using nested loop in this problem

To print all primes till n, we typically use nested loops, but using the Sieve of Eratosthenes (prime sieve) optimizes it.

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.