tag:blogger.com,1999:blog-777371232453841305.post4728173162131343054..comments2024-03-19T14:14:18.417+07:00Comments on lamida.net: Fibonacci Sequence With and Without RecursionJonhttp://www.blogger.com/profile/07227923197745561620noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-777371232453841305.post-37079637624961091412019-06-11T19:25:28.493+07:002019-06-11T19:25:28.493+07:00Why the hell are you using recursion or a loop ? S...Why the hell are you using recursion or a loop ? Since 17th century we can calculate Fibonacci for any value n using :<br />lround((pow(0.5 + 0.5 * sqrt(5.0), n) - <br /> pow(0.5 - 0.5 * sqrt(5.0), n)) / <br /> sqrt(5.0))Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-777371232453841305.post-85816109441940637242018-04-24T15:34:36.799+07:002018-04-24T15:34:36.799+07:00Thanks for explaining this term! I am sure that I&...Thanks for explaining this term! I am sure that I'll be able to easily follow the instruction!king lear essayhttp://writing-help.org/blog/king-lear-essay.htmlnoreply@blogger.comtag:blogger.com,1999:blog-777371232453841305.post-69700056289881444232017-04-13T15:18:06.342+07:002017-04-13T15:18:06.342+07:00Hello,thanks for your code:)
then I found a small ...Hello,thanks for your code:)<br />then I found a small mistake in your code.<br /><br />the code with Recursion <br />int fibo(int in) → int n<br /><br />if(n <= 1){<br /> return n → miss a semicolon<br /><br />Thanks to your neat code!家家瑞https://www.blogger.com/profile/03286027102112048803noreply@blogger.com