Anonymous user
Pandigital prime: Difference between revisions
m
→{{header|REXX}}: optimized the (DO K loop) search.
(→{{header|REXX}}: elided flag.) |
m (→{{header|REXX}}: optimized the (DO K loop) search.) |
||
Line 444:
=={{header|REXX}}==
The longest part of the program execution time was the generating of 402 primes.
Essentially, the CPU time was displayed as using 0.00 seconds (rounded to two fractional decimal digits).
<lang rexx>/*REXX program finds and displays the largest prime pandigital number. */
pand = reverse(123456789) /*get a big 9-digit pandigital number. */
Line 452 ⟶ 455:
call genP iSqrt($) /*gen primes up to $ (pandigital #). */
end
do k=$ by -
if verify($, k)>0 then iterate /*$ pandigital? No, skip. _____ */
do d=1 for #; p= @.d /*divide by all the primes ≤ √ K */
| |||