Multi-base primes: Difference between revisions
→{{header|Wren}}: Simple optimization - 3 times speed up.
(→{{header|Phix}}: added 0.9 only times) |
(→{{header|Wren}}: Simple optimization - 3 times speed up.) |
||
Line 534:
{{libheader|Wren-math}}
{{libheader|Wren-fmt}}
This takes about
<lang ecmascript>import "/math" for Int, Nums
import "/fmt" for Conv
Line 545:
var process = Fn.new { |indices|
var bases = []▼
var minBase = 2.max(Nums.max(indices) + 1)
if (37 - minBase < mostBases) return // can't affect results so return
▲ var bases = []
for (b in minBase..36) {
var n = 0
| |||