-
-
Notifications
You must be signed in to change notification settings - Fork 97
/
segmented_sieve.py
67 lines (49 loc) · 1.26 KB
/
segmented_sieve.py
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
# segmented sieve
from __future__ import annotations
import math
def sieve(n: int) -> tuple:
"""
>>> sieve(2 **3)
(2, 3, 5, 7)
>>> sieve(3 ** 3)
(2, 3, 5, 7, 11, 13, 17, 19, 23)
>>> sieve(4)
(2, 3)
"""
in_prime = []
start = 2
end = int(math.sqrt(n))
temp = [True] * (end + 1)
prime = []
while start <= end:
if temp[start] is True:
in_prime.append(start)
for i in range(start * start, end + 1, start):
if temp[i] is True:
temp[i] = False
start += 1
prime += in_prime
low = end + 1
high = low + end - 1
if high > n:
high = n
while low <= n:
temp = [True] * (high - low + 1)
for each in in_prime:
t = math.floor(low / each) * each
if t < low:
t += each
for j in range(t, high + 1, each):
temp[j - low] = False
for j in range(len(temp)):
if temp[j] is True:
prime.append(low + j)
low = high + 1
high = low + end - 1
if high > n:
high = n
return tuple(prime)
if __name__ == "__main__":
import doctest
doctest.testmod(verbose=True)
# print(sieve(4))