Timeline for Can I optimize my implementation of generating Fibonacci series using recursion?
Current License: CC BY-SA 4.0
Post Revisions
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 26, 2022 at 20:59 | answer | added | Blindman67 | timeline score: 1 | |
| May 24, 2022 at 15:15 | comment | added | RobH |
The Fibonacci sequence is 0, 1, 1, 2, 3... i.e. 1 is there twice. Your code isn't correct.
|
|
| May 24, 2022 at 13:34 | comment | added | greybeard | You may get more useful reviews if you stated your goal in coding the above. You have been pointed to avoidable special casing more than once. | |
| May 24, 2022 at 12:46 | history | asked | Rahul Shivsharan | CC BY-SA 4.0 |