Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Segmented sieve - doctests #9945

Merged
merged 17 commits into from
Oct 7, 2023
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
38 changes: 36 additions & 2 deletions maths/segmented_sieve.py
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,36 @@


def sieve(n: int) -> list[int]:
"""Segmented Sieve."""
"""
Segmented Sieve.

Examples:
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please add a doctest where the input itself is a prime number. For example,

>>> sieve(29)
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29]

This is to clarify whether the algorithm includes the input number itself or not.

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

In addition, please make sure that the function can correctly handle negative and zero inputs

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@tianyizheng02 corrected.

>>> 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
Expand Down Expand Up @@ -42,4 +71,9 @@ def sieve(n: int) -> list[int]:
return prime


print(sieve(10**6))
if __name__ == "__main__":
import doctest

doctest.testmod()

print(f"{sieve(10**6) = }")