tag:blogger.com,1999:blog-35897879.post5165875199424066375..comments2023-11-02T21:16:09.308+11:00Comments on Java-Success Blog: Java coding question on the popular Fibonacci sequenceAnonymoushttp://www.blogger.com/profile/00869496028596976417noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-35897879.post-67193536622396915352012-12-13T08:55:02.314+11:002012-12-13T08:55:02.314+11:00The above solutions are costly.Use this formula to...The above solutions are costly.Use this formula to calculate n th fibonacci number <br /><br /><br />Fib(n) = (1/√5)(((1 + √5)/2)-(1 - √5)/2)) <br /><br />Thanks<br />sreekanth nairAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-35897879.post-84086594105550830142012-08-18T18:16:55.811+10:002012-08-18T18:16:55.811+10:00The recursive algorithm has exponential complexity...The recursive algorithm has exponential complexity!Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-35897879.post-68644397235962698002012-08-16T03:35:24.036+10:002012-08-16T03:35:24.036+10:00Note that one of these solutions is O(N) and one i...Note that one of these solutions is O(N) and one is O(1.6^N).Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-35897879.post-82053128224639062742012-07-27T15:35:35.798+10:002012-07-27T15:35:35.798+10:00if we observe carefully starting from the 3rd elem...if we observe carefully starting from the 3rd element every 3rd element is even.<br />so we add that element we can get the sum of even elementsBhupala Sureshhttps://www.blogger.com/profile/15961894336981529313noreply@blogger.com