Anonymous user
Anonymous recursion: Difference between revisions
m
→{{header|Elena}}
imported>Arakov |
|||
| (6 intermediate revisions by 4 users not shown) | |||
Line 451:
Invalid argument: -10
55</pre>
{{works with|Chipmunk Basic|3.6.4}}
110 sub fib(num)
120 if num < 0 then print "Invalid argument: "; : fib = num
130 if num < 2 then fib = num else fib = fib(num-1)+fib(num-2)
140 end sub
190 print fib(20)
200 print fib(30)
210 print fib(-10)
220 print fib(10)
{{out}}
<pre>Same as BASIC256 entry.</pre>
==={{header|BBC BASIC}}===
Line 465 ⟶ 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▼
230 END DEF </syntaxhighlight>
=={{header|Bracmat}}==
Line 1,018 ⟶ 1,049:
=={{header|Elena}}==
ELENA
<syntaxhighlight lang="elena">import extensions;
fib(n)
{
if (n
{
^ this self(n
{
^
▲ }(n)
}
public program()
{
}</syntaxhighlight>
{{out}}
Line 1,621 ⟶ 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
▲220 CASE ELSE
▲230 LET FIB=FIB(K-1)+FIB(K-2)
▲240 END SELECT
▲250 END DEF</syntaxhighlight>
=={{header|J}}==
Line 3,605 ⟶ 3,617:
=={{header|Wren}}==
<syntaxhighlight lang="
static compute(n) {
var fib
| |||