Fibonacci sequence: Difference between revisions
Content deleted Content added
Added BASIC example. |
Added Python |
||
| Line 53: | Line 53: | ||
return recFibN(n-1) + recFibN(n-2); |
return recFibN(n-1) + recFibN(n-2); |
||
}</java> |
}</java> |
||
=={{header|Python}}== |
|||
===Iteractive=== |
|||
<python>def fibIter(n): |
|||
if n <= 2: |
|||
return 1 |
|||
fibPrev = 1 |
|||
fib = 1 |
|||
for num in xrange(2, n): |
|||
temp = fib |
|||
fib += fibPrev |
|||
fibPrev = temp |
|||
return fib</python> |
|||
===Recursive=== |
|||
<python>def fibRec(n): |
|||
if n <= 2: |
|||
return 1 |
|||
else: |
|||
return fibRec(n-1) + fibRec(n-2)</python> |
|||