Sudan function: Difference between revisions

=={{header|Ada}}==

{{trans|Javascript}}

 

procedure Sudan_Function is

Put_Line ("F2 (2, 1) = " & F (2, 2, 1)'Image);

Put_Line ("F3 (1, 1) = " & F (3, 1, 1)'Image);

{{out}}

<pre>

{{Trans|Wren}}

...with a minor optimisation.

PROC sudan = ( INT n, x, y )INT:

IF n = 0 THEN x + y

print( ( "F(3, 1, 1) = ", whole( sudan( 3, 1, 1 ), 0 ), newline ) );

print( ( "F(2, 2, 1) = ", whole( sudan( 2, 2, 1 ), 0 ), newline ) )

{{out}}

<pre>

</pre>

=={{header|AWK}}==

# syntax: GAWK -f SUDAN_FUNCTION.AWK

BEGIN {

return(new_str)

}

{{out}}

<pre>

==={{header|BASIC256}}===

{{trans|FreeBASIC}}

print "Values of F(" & n & ", x, y):"

print "y/x 0 1 2 3 4 5"

if y = 0 then return x

return F(n - 1, F(n, x, y - 1), F(n, x, y - 1) + y)

{{out}}

<pre>Same as FreeBASIC entry.</pre>

 

==={{header|PureBasic}}===

If n = 0

ProcedureReturn x + y

PrintN("F(2,2,1) = " + Str(F(2,2,1)))

Input()

{{out}}

<pre>Similat to FreeBASIC entry.</pre>

==={{header|Yabasic}}===

{{trans|FreeBASIC}}

print "Values of F(", n, ", x, y):"

print "y/x 0 1 2 3 4 5"

if y = 0 return x

return F(n - 1, F(n, x, y - 1), F(n, x, y - 1) + y)

{{out}}

<pre>Same as FreeBASIC entry.</pre>

=={{header|C}}==

{{trans|Javascript}}

//Aamrun, 11th July 2022

 

return 0;

}

 

Output

=={{header|C++}}==

{{trans|C}}

//Aamrun , 11th July, 2022

 

return 0;

}

Output

<pre>

=={{header|C Sharp|C#}}==

{{trans|C}}

//Aamrun, 11th July 2022

 

}

}

Output

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2022-04-03}}

 

: sudan ( n x y -- z )

} cond ;

 

{{out}}

<pre>

 

Or with locals:

 

:: sudan ( n x y -- z )

{ [ y zero? ] [ x ] }

[ n 1 - n x y 1 - sudan dup y + sudan ]

 

=={{header|FreeBASIC}}==

{{trans|Wren and Phyton}}

If n = 0 Then Return x + y

If y = 0 Then Return x

Print "F(3,1,1) ="; F(3,1,1)

Print "F(2,2,1) ="; F(2,2,1)

{{out}}

<pre>Same as Wren entry.</pre>

=={{header|Go}}==

{{trans|Wren}}

 

import "fmt"

fmt.Printf("F(3, 1, 1) = %d\n", F(3, 1, 1))

fmt.Printf("F(2, 2, 1) = %d\n", F(2, 2, 1))

 

{{out}}

 

=={{header|Haskell}}==

import Data.List.Split (chunksOf)

import System.Environment (getArgs)

[read xlo .. read xhi]

[read ylo .. read yhi]

{{out}}

<pre>

 

=={{header|Hoon}}==

|= [n=@ x=@ y=@]

^- @

x

$(n (dec n), x $(n n, x x, y (dec y)), y (add $(n n, x x, y (dec y)) y))

 

=={{header|J}}==

{{trans|Javascript}}

This is, of course, not particularly efficient and some results are too large for a computer to represent.

if. 0=N do. X+Y

elseif. Y=0 do. X

else. F (N-1),(F N,X,Y-1), Y+F N, X, Y-1

end.

 

0

F 1 1 1

10228

F 2 2 1

 

=={{header|Java}}==

{{trans|C}}

//Aamrun, 11th July 2022

 

}

}

Output

<pre>

 

=={{header|Javascript}}==

/**

* @param {bigint} n

return F(n - 1, F(n, x, y - 1), F(n, x, y - 1) + y);

}

 

=={{header|Julia}}==

 

@memoize function sudan(n, x, y)

foreach(t -> println("sudan($(t[1]), $(t[2]), $(t[3])) = ",

sudan(t[1], t[2], t[3])), ((0,0,0), (1,1,1), (2,1,1), (3,1,1), (2,2,1)))

<pre>

sudan(0, 0, 0) = 0

=={{header|Perl}}==

Three ways of doing the same thing.

use experimental 'for_list';

 

for my($n,$x,$y) (0,0,0, 1,1,1, 2,1,1, 3,1,1, 2,2,1) {

say join ' ',F1($n,$x,$y), F2($n,$x,$y), F3($n,$x,$y)

{{out}}

<pre>0 0 0

 

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">function</span> <span style="color: #000000;">F</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">x</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">y</span><span style="color: #0000FF;">)</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"F(%d, %d, %d) = %d\n"</span><span style="color: #0000FF;">,{</span><span style="color: #000000;">n</span><span style="color: #0000FF;">,</span><span style="color: #000000;">x</span><span style="color: #0000FF;">,</span><span style="color: #000000;">y</span><span style="color: #0000FF;">,</span><span style="color: #000000;">F</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">,</span><span style="color: #000000;">x</span><span style="color: #0000FF;">,</span><span style="color: #000000;">y</span><span style="color: #0000FF;">)})</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

Output same as Wren.

 

=={{header|PHP}}==

{{trans|C}}

#Aamrun , 11th July 2022

 

echo "F(1,3,3) = " . F(1,3,3);

?>

Output

<pre>

=={{header|Python}}==

{{trans|Javascript}}

# Aamrun, 11th July 2022

 

print("F(1,3,3) = ", F(1,3,3))

 

Output

=={{header|R}}==

{{trans|C}}

#Aamrun, 11th July 2022

 

 

print(paste("F(1,3,3) = " , F(1,3,3)))

Output

<pre>

=={{header|Raku}}==

Outputting wiki-tables to more closely emulate the wikipedia examples. Not very efficient but good enough.

multi F ($n where * > 0, $x, 0) { $x }

multi F ($n, $x, $y) { F($n-1, F($n, $x, $y-1), F($n, $x, $y-1) + $y) }

say( "|}" );

}

{{out}}

{|class="wikitable"

 

=={{header|Ruby}}==

def sudan(n, x, y)

return x + y if n == 0

sudan(n - 1, sudan(n, x, y - 1), sudan(n, x, y - 1) + y)

end

 

Output

=={{header|Vlang}}==

{{trans|Wren}}

if n == 0 {

return x + y

println("F(3, 1, 1) = ${sudan(3, 1, 1)}")

println("F(2, 2, 1) = ${sudan(2, 2, 1)}")

 

{{out}}

=={{header|Wren}}==

{{libheader|Wren-fmt}}

 

var F = Fn.new { |n, x, y|

System.print("F(2, 1, 1) = %(F.call(2, 1, 1))")

System.print("F(3, 1, 1) = %(F.call(3, 1, 1))")

 

{{out}}

=={{header|XPL0}}==

{{trans|Wren}}

[if N = 0 then return X + Y;

if Y = 0 then return X;

Text(0, "F(3, 1, 1) = "); IntOut(0, F(3, 1, 1)); CrLf(0);

Text(0, "F(2, 2, 1) = "); IntOut(0, F(2, 2, 1)); CrLf(0);

 

{{out}}