Eratosthenes Sieve

#1

Is there a better method than Eratosthenes sieve, for finding primes upto N?

#2

hello @sarthakj2099,
No sieve is the most efficient method to find prime numbers upto n.

one brute force metods is also there.
i.e iterate from 1 to N , and check whether that number is prime or not using sqrt technique.

#3

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.