Loops/Increment loop index within loop body: Difference between revisions
Loops/Increment loop index within loop body (view source)
Revision as of 20:24, 10 May 2022
, 2 years agono edit summary
ReeceGoding (talk | contribs) m (→{{header|R}}: Improved syntax.) |
No edit summary |
||
Line 2,272:
Same as Kotlin entry
</pre>
=={{header|Haskell}}==
No index mutations or loops. Recursion is used.
Line 4,519 ⟶ 4,520:
41 : 49752014150467
42 : 99504028301131</pre>
=={{header|Tcl}}==
Inspired by Java and Kotlin variants.
Line 4,771 ⟶ 4,773:
i=41 : 49,752,014,150,467
i=42 : 99,504,028,301,131</pre>
=={{header|Vlang}}==
{{trans|go}}
<lang vlang>fn is_prime(n u64) bool {
if n % 2 == 0 {
return n == 2
}
if n % 3 == 0 {
return n == 3
}
mut d := u64(5)
for d * d <= n {
if n % d == 0 {
return false
}
d += 2
if n % d == 0 {
return false
}
d += 4
}
return true
}
const limit = 42
fn main() {
for i, n := u64(limit), 0; n<limit; i++ {
if is_prime(i) {
n++
println("n = ${n:-2} ${i:19}")
i += i - 1
}
}
}</lang>
{{out}}
<pre>
Same as Kotlin entry
</pre>
=={{header|Wren}}==
| |||