its equal to calculating the Fibonacci numbers till we get a number which is closest to and lesser than N...anything better??
On 5/24/11, Aakash Johari <aakashj....@gmail.com> wrote: > what about precomputation and then binary search...? > > > > On Tue, May 24, 2011 at 6:37 AM, sravanreddy001 > <sravanreddy...@gmail.com>wrote: > >> @Anyone worked on this before? >> I'm thinking of a time complexity of *(log N)^2 --> Square of (log N)* >> I've to prove on this.. >> >> If someone have time.. can you *prove that, the T'th fibinocci number is >> always greater than 'N'* >> *where T = (log N)^2 * >> >> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > -Aakash Johari > (IIIT Allahabad) > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- *Piyush Sinha* *IIIT, Allahabad* *+91-8792136657* *+91-7483122727* *https://www.facebook.com/profile.php?id=100000655377926 * -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
