tag:blogger.com,1999:blog-6605110739831561983.post4337856243405522917..comments2023-05-19T06:20:57.916-07:00Comments on Algorithms and Data Structures - Coding, Interviews, Google, Amazon, Microsoft, Apple, IBM: Nᵗʰ Fibonacci Number - Matrices MultiplicationIvan Kadiyskihttp://www.blogger.com/profile/16028324970371404209noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-6605110739831561983.post-47583387838517445802017-07-17T01:47:10.429-07:002017-07-17T01:47:10.429-07:00Great blog post and really helpful and your blog a...Great blog post and really helpful and your blog are very interesting and inspiring. <a href="http://www.midnightinfo.com" rel="nofollow">midnightinfo</a>Anonymoushttps://www.blogger.com/profile/13921580456895291476noreply@blogger.comtag:blogger.com,1999:blog-6605110739831561983.post-35028804550665187582014-10-10T05:15:24.397-07:002014-10-10T05:15:24.397-07:00This is an O(logN) solutions :
http://censore.blo...This is an O(logN) solutions :<br /><br />http://censore.blogspot.in/2014/10/fibonacci-series-with-matrix.htmlBiplavhttps://www.blogger.com/profile/13034840126404433963noreply@blogger.comtag:blogger.com,1999:blog-6605110739831561983.post-53171916440611944132013-11-05T05:15:28.516-08:002013-11-05T05:15:28.516-08:00Yes Arieel, you are right - it is O(N). The text o...Yes Arieel, you are right - it is O(N). The text of the hyperlink is changed.<br />Thanks!Ivan Kadiyskihttps://www.blogger.com/profile/16028324970371404209noreply@blogger.comtag:blogger.com,1999:blog-6605110739831561983.post-25409779455572174702013-10-31T02:57:54.200-07:002013-10-31T02:57:54.200-07:00It's not 0(log(N)), it's O(N)
You need to ...It's not 0(log(N)), it's O(N)<br />You need to divide N by 2 each time to reduce the the problem 2 times on each iteration.<br />Here u pick all n-th before the one you are looking for, so it's O(N)Arieelhttps://www.blogger.com/profile/16496951332008203224noreply@blogger.com