mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 23:11:09 +00:00
2122474e41
* Replacing the generator with numpy vector operations from lu_decomposition.
* Revert "Replacing the generator with numpy vector operations from lu_decomposition."
This reverts commit ad217c6616
.
* Added doctests.
* Update segmented_sieve.py
Removed unnecessary check.
* Update segmented_sieve.py
Added checks for 0 and negative numbers.
* [pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
* Update segmented_sieve.py
* Update segmented_sieve.py
Added float number check.
* Update segmented_sieve.py
* Update segmented_sieve.py
simplified verification
* [pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
* Update segmented_sieve.py
* [pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
* Update segmented_sieve.py
* [pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
* ValueError: Number 22.2 must instead be a positive integer
---------
Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
80 lines
1.7 KiB
Python
80 lines
1.7 KiB
Python
"""Segmented Sieve."""
|
|
|
|
import math
|
|
|
|
|
|
def sieve(n: int) -> list[int]:
|
|
"""
|
|
Segmented Sieve.
|
|
|
|
Examples:
|
|
>>> sieve(8)
|
|
[2, 3, 5, 7]
|
|
|
|
>>> sieve(27)
|
|
[2, 3, 5, 7, 11, 13, 17, 19, 23]
|
|
|
|
>>> sieve(0)
|
|
Traceback (most recent call last):
|
|
...
|
|
ValueError: Number 0 must instead be a positive integer
|
|
|
|
>>> sieve(-1)
|
|
Traceback (most recent call last):
|
|
...
|
|
ValueError: Number -1 must instead be a positive integer
|
|
|
|
>>> sieve(22.2)
|
|
Traceback (most recent call last):
|
|
...
|
|
ValueError: Number 22.2 must instead be a positive integer
|
|
"""
|
|
|
|
if n <= 0 or isinstance(n, float):
|
|
msg = f"Number {n} must instead be a positive integer"
|
|
raise ValueError(msg)
|
|
|
|
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):
|
|
temp[i] = False
|
|
start += 1
|
|
prime += in_prime
|
|
|
|
low = end + 1
|
|
high = min(2 * end, 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 = min(high + end, n)
|
|
|
|
return prime
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|
|
|
|
print(f"{sieve(10**6) = }")
|