Caculating Fibonachi Sequence WITHOUT using Recursion??

[Jynks]

Our teacher as part of our tutorial work wanted us to make a program to take a user input of "n" and calculate the Fibonachi sequence of that number. BUT... he wanted us to use a "progressive" function.. as in do nto use recursion where you call the function form inside the function.

Now I have completed the next puzzle with is to do the same thing but this time use recursion.. it was super easy.. but I just can not work out how to do this with out using recursion?

Any ideas?

[cire]

Use a loop.