mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 15:01:08 +00:00
24d3cf8244
* The black formatter is no longer beta
* pre-commit autoupdate
* pre-commit autoupdate
* Remove project_euler/problem_145 which is killing our CI tests
* updating DIRECTORY.md
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
52 lines
1.1 KiB
Python
52 lines
1.1 KiB
Python
"""Segmented Sieve."""
|
|
|
|
import math
|
|
|
|
|
|
def sieve(n):
|
|
"""Segmented Sieve."""
|
|
in_prime = []
|
|
start = 2
|
|
end = int(math.sqrt(n)) # Size of every segment
|
|
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(j + low)
|
|
|
|
low = high + 1
|
|
high = low + end - 1
|
|
if high > n:
|
|
high = n
|
|
|
|
return prime
|
|
|
|
|
|
print(sieve(10**6))
|