Anonymous user
Fibonacci sequence: Difference between revisions
Added BASIC example.
(Created task with Java) |
(Added BASIC example.) |
||
Line 5:
Write a function to generate the nth Fibonacci number. Solutions can be iterative or recursive (though recursive solutions are generally considered too slow and are mostly used as an exercise in recursion).
=={{header|BASIC}}==
{{works with|QuickBasic|4.5}}
===Iterative===
<qbasic>FUNCTION itFib (n)
IF (n <= 2) THEN
itFib = 1
ELSE
ans = 0
n1 = 1
n2 = 1
n = n - 2
DO WHILE (n > 0)
ans = n1 + n2
n1 = n2
n2 = ans
n = n - 1
LOOP
itFib = ans
END IF
END FUNCTION</qbasic>
===Recursive===
<qbasic>FUNCTION recFib (n)
IF (n <= 2) THEN
recFib = 1
ELSE
recFib = recFib(n - 1) + recFib(n - 2)
END IF
END FUNCTION</qbasic>
=={{header|Java}}==
| |||