Wash your hands, Be inside, Be safe and keep learning. #happyquarantine #happylearning
Welcome to NoobtoDev, Keep exploring and learning.
Your request has been submitted successfully
You've voted successfully
You've already voted!
just going through problems of cp, came to know about Sieve of Eratosthenes.. how can i use to find prime numbers faster?
+1
Sieve of Eratosthenes is an efficient way to find all the prime numbers smaller than or equal to n and n is also a small number.
Do comment here
Do comment here