Timeline for Calculating Fibonacci numbers
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2015 at 22:58 | comment | added | holroy | Still not a recursive solution, but it is a viable iterative solution. | |
| Nov 5, 2015 at 22:57 | comment | added | Scarrien | Changed the code almost completely. Now it stores the values in the variables and computes them more directly. Does this count as recursion? | |
| Nov 5, 2015 at 22:54 | history | edited | Scarrien | CC BY-SA 3.0 | almost completely changed the code. |
| Nov 5, 2015 at 19:15 | comment | added | holroy | This does not use recursion at all. It uses a lookup table when doing the math, not recursion. This is very close to the standard iterative version of calculating the Fibonacci numbers, and is a plain O(n) algorithm. Downside of this version, is that it does need to calculate all values, and it stores all of them as it is calculating. | |
| Nov 4, 2015 at 7:25 | history | edited | Scarrien | CC BY-SA 3.0 | added 53 characters in body |
| Nov 4, 2015 at 7:16 | history | edited | Scarrien | CC BY-SA 3.0 | added 53 characters in body |
| Nov 4, 2015 at 7:10 | history | answered | Scarrien | CC BY-SA 3.0 |