Quote:
Originally Posted by alkis
code 94, final exe 132
|
Much better.
If you only look at the formula you see that at step n you need to sum n-1 to n-2.
But you have to actually think about what does it represent the Fibonacci sequence: a recurrence relation.
So if you use n-2 as the current n..