forked from TheAlgorithms/Python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprime_sieve_eratosthenes.py
More file actions
47 lines (33 loc) · 837 Bytes
/
prime_sieve_eratosthenes.py
File metadata and controls
47 lines (33 loc) · 837 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
# flake8: noqa
"""
Sieve of Eratosthenes
Input : n =10
Output: 2 3 5 7
Input : n = 20
Output: 2 3 5 7 11 13 17 19
you can read in detail about this at
https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
"""
def prime_sieve_eratosthenes(num):
"""
print the prime numbers up to n
>>> prime_sieve_eratosthenes(10)
2,3,5,7,
>>> prime_sieve_eratosthenes(20)
2,3,5,7,11,13,17,19,
"""
primes = [True for i in range(num + 1)]
p = 2
while p * p <= num:
if primes[p]:
for i in range(p * p, num + 1, p):
primes[i] = False
p += 1
for prime in range(2, num + 1):
if primes[prime]:
print(prime, end=",")
if __name__ == "__main__":
import doctest
doctest.testmod()
num = int(input())
prime_sieve_eratosthenes(num)