mirror of
https://hub.njuu.cf/TheAlgorithms/Python.git
synced 2023-10-11 13:06:12 +08:00
897f1d0fb4
* Improved Formatting and Style I improved formatting and style to make PyLama happier. Linters used: - mccabe - pep257 - pydocstyle - pep8 - pycodestyle - pyflakes - pylint - isort * Create volume.py This script calculates the volumes of various shapes. * Delete lucasSeries.py * Revert "Delete lucasSeries.py" This reverts commit 64c19f7a6c8b74e15bed07f0f0337598a001ceb4. * Update lucasSeries.py
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))
|