Sieve Of Eratosthenes Algorithm | Sololearn: Learn to code for FREE!
+ 6
10th Dec 2017, 7:54 AM
Junth Basnet
4 Respostas
10th Dec 2017, 8:00 AM
Ranjan Bagri
Ranjan Bagri - avatar
+ 4
Thanks @Ranjan ūüėÉūüĎŹūüĎŹ
10th Dec 2017, 9:34 AM
Junth Basnet
+ 4
Thanks manūüĎąūüĎŹūüĎŹ
10th Dec 2017, 9:36 AM
Junth Basnet
+ 3
Sieve of Eratosthenes Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number. For example, if n is 10, the output should be ‚Äú2, 3, 5, 7‚ÄĚ. If n is 20, the output should be ‚Äú2, 3, 5, 7, 11, 13, 17, 19‚ÄĚ.
10th Dec 2017, 8:00 AM
Harsh
Harsh - avatar