Python/maths/segmented_sieve.py

46 lines
1020 B
Python
Raw Normal View History

"""Segmented Sieve."""
2018-10-19 12:48:28 +00:00
import math
def sieve(n: int) -> list[int]:
"""Segmented Sieve."""
2018-10-19 12:48:28 +00:00
in_prime = []
start = 2
end = int(math.sqrt(n)) # Size of every segment
2018-10-19 12:48:28 +00:00
temp = [True] * (end + 1)
prime = []
while start <= end:
if temp[start] is True:
2018-10-19 12:48:28 +00:00
in_prime.append(start)
for i in range(start * start, end + 1, start):
temp[i] = False
2018-10-19 12:48:28 +00:00
start += 1
prime += in_prime
2018-10-19 12:48:28 +00:00
low = end + 1
high = min(2 * end, n)
while low <= n:
temp = [True] * (high - low + 1)
2018-10-19 12:48:28 +00:00
for each in in_prime:
t = math.floor(low / each) * each
if t < low:
t += each
for j in range(t, high + 1, each):
2018-10-19 12:48:28 +00:00
temp[j - low] = False
2018-10-19 12:48:28 +00:00
for j in range(len(temp)):
if temp[j] is True:
prime.append(j + low)
2018-10-19 12:48:28 +00:00
low = high + 1
high = min(high + end, n)
2018-10-19 12:48:28 +00:00
return prime
print(sieve(10**6))