Anonymous user
Sieve of Eratosthenes: Difference between revisions
Add "dc" version
OtteromKram (talk | contribs) m (Assignment to `p` here is ineffectual, so just discarding the value is the proper action.) |
imported>Schraf (Add "dc" version) |
||
Line 5,524:
The algorithm can be sped up by a factor of four by extreme wheel factorization and (likely) about a factor of the effective number of CPU cores by using multi-processing isolates, but there isn't much point if one is to use the prime generator for output. For most purposes, it is better to use custom functions that directly manipulate the culled bit-packed page segments as `countPrimesTo` does here.
=={{header|dc}}==
<syntaxhighlight lang="dc">[dn[,]n dsx [d 1 r :a lx + d ln!<.] ds.x lx] ds@
[sn 2 [d;a 0=@ 1 + d ln!<#] ds#x] se
100 lex</syntaxhighlight>
{{out}}
<pre>2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,\
97,</pre>
=={{header|Delphi}}==
| |||