Timeline for Python 3 - Fibonacci Implementation
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 22, 2017 at 6:36 | comment | added | Snowbody | You ought to mention that the [0] * (n+1) uses additional memory in the interests of making the notation clearer. | |
| Dec 22, 2017 at 5:57 | history | edited | abuzittin gillifirca | CC BY-SA 3.0 | added 787 characters in body |
| Dec 20, 2017 at 17:18 | comment | added | Arthur Tacca | It's hard to imagine a clearer implementation than the one by vnp, which does re-assign parameters. Perhaps the rule should be that you can re-assign parameters if the alternative is to make a variable whose only purpose is to simulate a parameter that you would've assigned to. Or perhaps the rule should be do not re-assign parameters, like you said, but don't be afraid to break the rules sometimes. | |
| Dec 20, 2017 at 11:42 | comment | added | user7802048 | How would you name the function/parameters to be more clear? | |
| Dec 20, 2017 at 7:53 | history | answered | abuzittin gillifirca | CC BY-SA 3.0 |