Twin primes: Difference between revisions

m
m (→‎{{header|Raku}}: Added a runtime on my (fairly beefy) system)
m (→‎{{header|Phix}}: online tag)
Line 1,372:
The time complexity here is all about building a table of primes. It turns out that using the builtin get_prime() is actually faster
than using an explicit sieve (as per Delphi/Go/Wren) due to retaining all the intermediate 0s, not that I particularly expect this to win any performance trophies.
<!--(phixonline)-->
<syntaxhighlight lang="phix">
with javascript_semantics
7,804

edits