Anonymous recursion: Difference between revisions

Anonymous recursion (view source)

Revision as of 20:28, 3 January 2024

95 bytes removed , 4 months ago

m

→‎{{header|Elena}}

Anonymous user

imported>Arakov

Revision as of 19:07, 27 October 2023 (view source) Jjuanhdez (talk \| contribs) (Added Chipmunk Basic) ← Older edit		Revision as of 20:28, 3 January 2024 (view source) imported>Arakov m (→‎{{header\|Elena}}) Newer edit →
(5 intermediate revisions by 3 users not shown)
Line 480: 55 </pre> ==={{header\|IS-BASIC}}===▼ <syntaxhighlight lang="is-basic">100 PROGRAM "Fibonacc.bas"▼ 110 FOR I=0 TO 10▼ 120 PRINT FIB(I);▼ 130 NEXT ▼ 140 DEF FIB(K)▼ 150 SELECT CASE K▼ 160 CASE IS<0▼ 170 PRINT "Negative parameter to Fibonacci.":STOP ▼ 180 CASE 0,1▼ 190 LET FIB=0K▼ ~~220~~ 200 CASE ELSE▼ ~~230~~ 210 LET FIB=FIB(K-1)+FIB(K-2)▼ ~~240~~ 220 END SELECT ▼ ~~250~~ 230 END DEF </syntaxhighlight>▼ =={{header\|Bracmat}}== Line 1,033 ⟶ 1,049: =={{header\|Elena}}== ELENA 46.x: <syntaxhighlight lang="elena">import extensions; fib(n) { if (n < 0) { InvalidArgumentException.raise() }; ^ (n) { if (n {> 1) { ~~if (n > 1)~~ ^ this self(n {- 2) + (this self(n - 1)) }~~(n)~~▼ ~~^ this self(n - 2) + (this self(n - 1))~~ }else { ~~else~~ ^ {n ~~^ n~~ } }(n) ▲ }(n) } public program() { for (int i := -1,; i <= 10,; i += 1) { console.print("fib(",i,")="); try { console.printLine(fib(i)) } catch(Exception e) { console.printLine:("invalid") } }; console.readChar() }</syntaxhighlight> {{out}} Line 1,636 ⟶ 1,651: fib2(x floor) )</syntaxhighlight> ▲=={{header\|IS-BASIC}}== ▲<syntaxhighlight lang="is-basic">100 PROGRAM "Fibonacc.bas" ▲110 FOR I=0 TO 10 ▲120 PRINT FIB(I); ▲130 NEXT ▲140 DEF FIB(K) ▲150 SELECT CASE K ▲160 CASE IS<0 ▲170 PRINT "Negative parameter to Fibonacci.":STOP ▲180 CASE 0 ▲190 LET FIB=0 ~~200 CASE 1~~ ~~210 LET FIB=1~~ ▲220 CASE ELSE ▲230 LET FIB=FIB(K-1)+FIB(K-2) ▲240 END SELECT ▲250 END DEF</syntaxhighlight> =={{header\|J}}== Line 3,620 ⟶ 3,617: =={{header\|Wren}}== <syntaxhighlight lang="~~ecmascript~~wren">class Fibonacci { static compute(n) { var fib