Timeline for Find nth Fibonacci Number, using iteration and recursion
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 19, 2020 at 17:40 | history | edited | Sriv | CC BY-SA 4.0 |
deleted 139 characters in body
|
| Feb 19, 2020 at 17:38 | comment | added | Sriv | @gazoh You are right. I thought the OP asked for recursion in general and not specifically for Fibonacci. I am quite sorry. I will edit my answer as soon as possible! | |
| Feb 19, 2020 at 17:35 | comment | added | Sriv | @1201ProgramAlarm 😂 Nice point! I've changed that | |
| Feb 19, 2020 at 17:34 | history | edited | Sriv | CC BY-SA 4.0 |
deleted 146 characters in body; added 110 characters in body
|
| Feb 19, 2020 at 17:18 | comment | added | 1201ProgramAlarm | A giant purple rectangle is just hideous, and when scrolling down the page just screams "ADVERTISEMENT!" which causes me to just skip way further down fast and get that thing off my screen. There is absolutely NO reason to have that here. If you're going to have a quote, use text to do it. Although that bit seems completely irrelevant to the requested code review (IMHO). | |
| Feb 19, 2020 at 13:35 | comment | added | gazoh | I fail to see how you answer the questions (why is recursion usually recommended for calculating the Fibonacci sequence? What are possible alternatives to these 2 approach?), it doesn't comment on the code itself, and uses pictures to display text, which is bad form since it cannot be searched and used as a reference in the future. The first 2 points make your answer look like an ad for dynamic programming rather than a code review, and you should use blockquotes and links to the sources for the 3rd point. | |
| Feb 19, 2020 at 11:56 | comment | added | Sriv | I don't understand why two people down-voted my answer. Would someone please explain why so that I won't repeat the same mistake in the future? Thanks a lot! | |
| Feb 18, 2020 at 21:42 | history | answered | Sriv | CC BY-SA 4.0 |