Anonymous user
Talk:Carmichael 3 strong pseudoprimes: Difference between revisions
Talk:Carmichael 3 strong pseudoprimes (view source)
Revision as of 08:11, 11 December 2012
, 11 years ago→optimization: added a new section. -- ~~~~
(→listing in ascending order: added a tidbit about Carmichael numbers being odd. -- ~~~~) |
(→optimization: added a new section. -- ~~~~) |
||
Line 4:
This would make some programs a wee bit faster starting at 3 instead of 2. -- [[User:Gerard Schildberger|Gerard Schildberger]] 06:58, 11 December 2012 (UTC)
==optimization==
By changing the order of the '''if''' statements (in the definition of Prime1, Prime2, and Prime3) made the REXX program about three times faster, along with unrolling the compound '''if''' statements.
Also note that the REXX language doesn't have short circuits, so this is of concern with other languages not having that capability (short circuits). -- [[User:Gerard Schildberger|Gerard Schildberger]] 08:11, 11 December 2012 (UTC)
==listing in ascending order==
| |||