Timeline for More efficient solution for Project Euler #2 (sum of Fibonacci numbers under 4 million)
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 21, 2017 at 16:50 | history | edited | jacktrader | CC BY-SA 3.0 |
edited body
|
| Jul 25, 2016 at 23:27 | history | edited | jacktrader | CC BY-SA 3.0 |
Additional solution added.
|
| Jul 25, 2016 at 7:59 | history | edited | jacktrader | CC BY-SA 3.0 |
P.P.S.
|
| Jul 25, 2016 at 7:58 | comment | added | SylvainD |
This problem is a good scenario for using generator : the fib function shouldn't need to be concerned about where the values it generates are put and in your case, you don't even need a temporary list. @Karl's answer ( codereview.stackexchange.com/a/39495/9452 ) is a good example of this.
|
|
| Jul 25, 2016 at 7:56 | review | Late answers | |||
| Jul 25, 2016 at 14:27 | |||||
| Jul 25, 2016 at 7:51 | history | edited | jacktrader | CC BY-SA 3.0 |
Added benchmarks and code edit (didn't read every note in the initial questions).
|
| Jul 25, 2016 at 7:41 | review | First posts | |||
| Jul 25, 2016 at 7:44 | |||||
| Jul 25, 2016 at 7:40 | history | answered | jacktrader | CC BY-SA 3.0 |