# Fibonacci numbers (Icon)

### From LiteratePrograms

**Other implementations**: ALGOL 68 | Alice ML | bc | C | C Plus Plus templates | dc | E | Eiffel | Erlang | Forth | FORTRAN | Haskell | Hume |**Icon**| Java | JavaScript | Lisp | Logo | Lua | Mercury | OCaml | occam | Oz | Pascal | PIR | PostScript | Python | Ruby | Scala | Scheme | Sed | sh | sh, iterative | Smalltalk | T-SQL | Visual Basic .NET

The Fibonacci numbers are the integer sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, ..., in which each item is formed by adding the previous two. The sequence can be defined recursively by

- 1 \\ \end{cases} ."/>

Fibonacci number programs that implement this definition directly are often used as introductory examples of recursion. However, many other algorithms for calculating (or making use of) Fibonacci numbers also exist.

In this article we show two ways of calculating fibonacci numbers in Icon.

<<fib.i>>=fib fastfib test

## Recursive

This is a very simple recursive implementation. This will become slow on big numbers, because the numbers are recalculated for each recursion.

<<fib>>=procedurefib(n)ifn<2thenreturnnelsereturnfib(n-1)+fib(n-2)end

## Iterative

This is a faster, but also somewhat more complicated way to calculate fibonacci numbers. To avoid recalculation and recursion, we store the two previous numbers in local variables.

<<fastfib>>=procedurefastfib(n)localprevfib, currfib, nfib nfib:=2 prevfib:=1 currfib:=1whilenfib<ndo{prevfib:=:currfib currfib+:=prevfib nfib+:=1}returncurrfibend

## Test

If we run this test code, we can see that the iterative method is significantly faster then the recursive.

<<test>>=proceduremain()localn n:=1whilen<30do{write(fib(n))n+:=1}n:=1whilen<30do{write(fastfib(n))n+:=1}end

Download code |