Algorithmintro
Sieve of Eratosthenes
Also called Eratosthenes sieve.
Marks multiples of each prime up to n to list all primes in O(n log log n) time.
Marks multiples of each prime up to n to list all primes in O(n log log n) time.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag F0W4PP Edit this page History Report an error