Rare numbers: Difference between revisions
→{{header|langur}}
imported>Sassela (Add Racket solution) |
Langurmonkey (talk | contribs) |
||
| (5 intermediate revisions by 2 users not shown) | |||
Line 3,894:
=== not optimized ===
It could look something like the following (ignoring whatever optimizations the other examples are using), if it was fast enough. I did not have the time/processor to test finding the first 5. The
<syntaxhighlight lang="langur">
val
val
if
val
val
}
val
for[=[]]
if
_for ~= [
}
}
}
val findandprint = impure fn(mx) {
# if you have the time...▼
for[cnt=0] i = 0; cnt < mx ; i += 1 {
writeln "the first 5 rare numbers: ", .findfirst(5)</syntaxhighlight>▼
if israre(i) {
writeln "\n rare ", i, " "
cnt += 1
}
}
}
▲# if you have the time...
</syntaxhighlight>
=={{header|Lua}}==
Line 6,512 ⟶ 6,517:
===Traditional===
About 9.5 minutes to find the first 25 rare numbers.
<syntaxhighlight lang="
import "./fmt" for Fmt
class Term {
Line 6,786 ⟶ 6,791:
===Turbo===
Ruffles the feathers a little with a time 5 times quicker than the 'traditional' version.
<syntaxhighlight lang="
import "./fmt" for Fmt
import "./date" for Date
class Z2 {
| |||