Fibonacci sequence: Difference between revisions
Content added Content deleted
(→{{header|Palo Alto Tiny BASIC}}: Added a solution.) |
(Added Chipmunk Basic and MSX Basic) |
||
Line 1,608: | Line 1,608: | ||
233 233 |
233 233 |
||
121393 121393</pre> |
121393 121393</pre> |
||
==={{header|Chipmunk Basic}}=== |
|||
{{works with|Chipmunk Basic|3.6.4}} |
|||
<syntaxhighlight lang="qbasic">100 cls |
|||
110 for i = 0 to 20 : print fibor(i); : next i |
|||
120 print |
|||
130 for i = 0 to 20 : print fiboi(i); : next i |
|||
140 print |
|||
150 for i = 0 to 20 : print fiboa(i); : next i |
|||
160 end |
|||
170 sub fibor(n) : 'Recursive |
|||
180 if n < 2 then |
|||
190 fibor = n |
|||
200 else |
|||
210 fibor = fibor(n-1)+fibor(n-2) |
|||
220 endif |
|||
230 end sub |
|||
240 sub fiboi(n) : 'Iterative |
|||
250 n1 = 0 |
|||
260 n2 = 1 |
|||
270 for k = 1 to abs(n) |
|||
280 sum = n1+n2 |
|||
290 n1 = n2 |
|||
300 n2 = sum |
|||
310 next k |
|||
320 if n < 0 then |
|||
330 fiboi = n1*((-1)^((-n)+1)) |
|||
340 else |
|||
350 fiboi = n1 |
|||
360 endif |
|||
370 end sub |
|||
380 sub fiboa(n) : 'Analytic |
|||
390 fiboa = int(0.5+(((sqr 5+1)/2)^n)/sqr 5) |
|||
400 end sub</syntaxhighlight> |
|||
{{out}} |
|||
<pre>0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 |
|||
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 |
|||
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765</pre> |
|||
==={{header|Commodore BASIC}}=== |
==={{header|Commodore BASIC}}=== |
||
Line 2,231: | Line 2,269: | ||
1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040 1346269 2178309 3524578 5702887 9227465 14930352 24157817 39088169 63245986 102334155 165580141 267914296 433494437 701408733 1134903170 1836311903 2971215073 4807526976 7778742049 12586269025 20365011074 32951280099 53316291173 86267571272 139583862445 225851433717 365435296162 591286729879 956722026041 1548008755920 2504730781961 4052739537881 6557470319842 10610209857723 17167680177565 27777890035288 44945570212853 72723460248141 117669030460994 |
1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040 1346269 2178309 3524578 5702887 9227465 14930352 24157817 39088169 63245986 102334155 165580141 267914296 433494437 701408733 1134903170 1836311903 2971215073 4807526976 7778742049 12586269025 20365011074 32951280099 53316291173 86267571272 139583862445 225851433717 365435296162 591286729879 956722026041 1548008755920 2504730781961 4052739537881 6557470319842 10610209857723 17167680177565 27777890035288 44945570212853 72723460248141 117669030460994 |
||
</pre> |
</pre> |
||
==={{header|MSX Basic}}=== |
|||
{{works with|QBasic}} |
|||
{{works with|Chipmunk Basic}} |
|||
{{works with|GW-BASIC}} |
|||
<syntaxhighlight lang="qbasic">100 CLS |
|||
110 FOR N = 0 TO 15: GOSUB 130: PRINT FIBOI; : NEXT N |
|||
120 END |
|||
130 REM Iterative Fibonacci sequence |
|||
140 N1 = 0 |
|||
150 N2 = 1 |
|||
160 FOR K = 1 TO ABS(N) |
|||
170 SUM = N1 + N2 |
|||
180 N1 = N2 |
|||
190 N2 = SUM |
|||
200 NEXT K |
|||
210 IF N < 0 THEN FIBOI = N1 * ((-1) ^ ((-N) + 1)) ELSE FIBOI = N1 |
|||
220 RETURN</syntaxhighlight> |
|||
==={{header|Palo Alto Tiny BASIC}}=== |
==={{header|Palo Alto Tiny BASIC}}=== |