Program for this program
in this question first build the seive array
which tells which no is prime which not
now in each testcase just count no of primes in given range
Reference Code
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.
Sieve of Eratosthenes is used to get all prime numbers in a given range and is a very efficient algorithm. Acquire the skills and understanding of Python to confidently apply for Python programming jobs by learning Python Classes in Pune. This course is designed for beginners who have never programmed before, as well as existing programmers who want to increase their career options by learning Python.