Idoneal numbers: Difference between revisions

Content added Content deleted
(→‎{{header|jq}}: NDEBUG timing)
Line 215: Line 215:
This entry uses jq's `break` because the equivalent program using `until` is much slower.
This entry uses jq's `break` because the equivalent program using `until` is much slower.


Using either the C or Go implementations of jq,
Using an NDEBUG version of the C implementation of jq,
the program shown below takes about 5 seconds to produce the 65
the program shown below takes about 2.5 seconds to produce the 65
idoneal numbers.
idoneal numbers on a 3 GHz machine; gojq takes about 5 seconds.
For gojq, the definition of the `_nwise` helper function must be
For gojq, the definition of the `_nwise` helper function must be
uncommented.
uncommented.