Find largest left truncatable prime in a given base: Difference between revisions

m
Phix/mpfr
m (→‎{{header|Phix}}: removed pointless re-test (no speedup tho))
m (Phix/mpfr)
Line 1,259:
 
=={{header|Phix}}==
{{libheader|Phix/mpfr}}
{{trans|C}}
Depth-first search uses 1% of the memory of width-first search, and as a result runs about 30% faster (while still doing exactly the same actual work).
7,803

edits