Pascal's triangle: Difference between revisions

m
→‎{{header|Wren}}: Minor tidy and now uses binomial method in Math module.
(Added Easylang)
m (→‎{{header|Wren}}: Minor tidy and now uses binomial method in Math module.)
 
(2 intermediate revisions by one other user not shown)
Line 2,037:
=={{header|EasyLang}}==
<syntaxhighlight>
numfmt 0 4
r[] = [ 1 ]
proc pascal n . .
for i to 10
rnr[] = [ 1 ]
lfor =i 0to n
for r in rrn[] = [ ]
writel r= & " "0
rn[]for &=j lto +n - len r[]
l = r write " "
} .
for r iin = i + 1r[]
write r
rn[] &= l + r
var i = n - kl += 1r
.
print ""
swap r[] rn[] &= l
swap r[] rn[]
.
print ""
rn[] &= l
swap r[] rn[]
.
pascal 13
</syntaxhighlight>
 
Line 6,399 ⟶ 6,406:
=={{header|Wren}}==
{{libheader|Wren-fmt}}
{{libheader|wrenWren-math}}
<syntaxhighlight lang="ecmascriptwren">import "./fmt" for Fmt
import "./math" for Int
 
var binomial = Fn.new { |n, k|
if (n == k) return 1
var prod = 1
var i = n - k + 1
while (i <= n) {
prod = prod * i
i = i + 1
}
return prod / Int.factorial(k)
}
 
var pascalTriangle = Fn.new { |n|
Line 6,419 ⟶ 6,415:
System.write(" " * (n-i-1))
for (j in 0..i) {
Fmt.write("$3d ", binomialInt.callbinomial(i, j))
}
System.print()
9,476

edits