Fibonacci sequence: Difference between revisions
Content deleted Content added
m typo |
Added MAXScript |
||
| Line 53: | Line 53: | ||
return recFibN(n-1) + recFibN(n-2); |
return recFibN(n-1) + recFibN(n-2); |
||
}</java> |
}</java> |
||
=={{header|MAXScript}}== |
|||
===Iterative=== |
|||
fn fibIter n = |
|||
( |
|||
if n <= 2 then |
|||
( |
|||
1 |
|||
) |
|||
else |
|||
( |
|||
fib = 1 |
|||
fibPrev = 1 |
|||
for num in 3 to n do |
|||
( |
|||
temp = fib |
|||
fib += fibPrev |
|||
fibPrev = temp |
|||
) |
|||
fib |
|||
) |
|||
) |
|||
===Recursive=== |
|||
fn fibRec n = |
|||
( |
|||
if n <= 2 then |
|||
( |
|||
1 |
|||
) |
|||
else |
|||
( |
|||
fibRec (n - 1) + fibRec (n - 2) |
|||
) |
|||
) |
|||
=={{header|Python}}== |
=={{header|Python}}== |
||