Calculates all prime numbers from 2 to n using Sieve of Eratosthenes with time complexity: O(sqrt(n)loglog(n))
-
Notifications
You must be signed in to change notification settings - Fork 1
txrp0x9/py_prime_number
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Calculates all prime numbers from 2 to n using Sieve of Eratosthenes with time complexity: O(sqrt(n)loglog(n))
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published