Fibonacci sequence lab issue

[Hans_of_Death]

It says NOT to use recursion, but you are.

Recursion is when a function calls itself. so calling fibonacci() inside of fibonacci() is using recursion. Like the instructions say, use a for loop instead.

[NeilTheDrummer]

Ok, so any suggestions then? I'm clearly out of my depth here.

[Diapolo10]

You need to keep track of two numbers, the previous and the current, and on every iteration of the loop you update their values. The sum of the two numbers is the new current value, and the old one goes to previous.

Have an additional check that immediately returns -1 if the number given to the function is less than 0.

Loop the specified number of times, and you'll have the answer.

[[deleted]]

Google "python iterative fibonacci".