Timeline for Python 3 - Fibonacci Implementation
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 20, 2017 at 7:48 | comment | added | abuzittin gillifirca | only one case that can beat your algorithm is... see @vnp's answer for another case that does better than O(n). or the usual closed formula which is another O(1) case. | |
| Dec 20, 2017 at 0:53 | history | answered | zenwraight | CC BY-SA 3.0 |