Anonymous user
Sieve of Eratosthenes: Difference between revisions
m
→wheel version with optional prime list suppression: optimized the computing of J².
m (→wheel version: optimized for computing the square of J.) |
m (→wheel version with optional prime list suppression: optimized the computing of J².) |
||
Line 3,924:
if tell then say right(#,w+20)th(#) 'prime ───► ' right(j,w)
if skip then iterate /*should the top part be skipped?*/
if jj>H
do m=jj to H by j+j; @.m=0; end /*odd multiples.*/
end /*plain*/ /*[↑] strike odd multiples ¬prime*/
end /*j*/
|