A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.
The Sieve of Eratosthenes is a simple, ancient algorithm for finding all prime numbers in a bounded set.
🔔 Complexity is considered in terms of worst case.
| Notes | |
|---|---|
| Θ(n log log n) |
TODO