Catalan numbers: Difference between revisions

 
(4 intermediate revisions by 3 users not shown)
Line 2,961:
[[File:Fōrmulæ - Catalan numbers 01.png]]
 
[[File:Fōrmulæ - Catalan numbers 02a02.png]]
 
'''Direct definition (alternative)'''
Line 2,979:
The next function make use of the "second" form of recursive definition (without recursion):
 
[[File:Fōrmulæ - Catalan numbers 04a04.png]]
 
[[File:Fōrmulæ - Catalan numbers 05.png]]
Line 3,778:
=={{header|langur}}==
{{trans|Perl}}
<syntaxhighlight lang="langur">val .factorial = ffn x:if(.x < 2: 1; .x x* self(.x - 1))
val .catalan = f(.n) .factorial(2 x .n) / .factorial(.n+1) / .factorial(.n)
 
val .catalan = f(.fn n) .:factorial(2 x* .n) / .factorial(.n+1) / .factorial(.n)
for .i in 0..15 {
 
writeln $"\.i:2;: \(.catalan(.i):10)"
for .i in 0..15 {
writeln $"\.{{i:2;}}: \(.{{catalan(.i):10)}}"
}
 
writeln "10000: ", .catalan(10000)</syntaxhighlight>
</syntaxhighlight>
 
{{out}}
Line 6,169 ⟶ 6,171:
{{libheader|Wren-fmt}}
{{libheader|Wren-math}}
<syntaxhighlight lang="ecmascriptwren">import "./fmt" for Fmt
import "./math" for Int
var catalan = Fn.new { |n|
Line 6,232 ⟶ 6,234:
15 9694845
</pre>
 
=={{header|XLISP}}==
<syntaxhighlight lang="lisp">(defun catalan (n)
1,007

edits