Yes, this was a good observation. So I better keep the running total in the Fibonacci method, and use the previous results to prevent doing all that extra work. I'll modify it.
Type: Posts; User: zeralda21
Re: Overflow and time-efficient in a for-loop?
Yes, this was a good observation. So I better keep the running total in the Fibonacci method, and use the previous results to prevent doing all that extra work. I'll modify it.
Re: Overflow and time-efficient in a for-loop?
I was more concerned about obvious flaws and time-consuming operations(like the recursive way, although simpler). I went through the Wiki page and it looks interesting but I doubt that it requires...
Overflow and time-efficient in a for-loop?
Project Euler, problem 2: Determine the sum of the even numbers in the Fibonacci sequence up to 4 000 000. First I tried to
use a recursive algorithm for the sequence but I realized I dont have all...