At first glance, I would say do an incremental search for the nth fibonacci number...i.e set n=0, then n=1, n=2, n=4, n=8, n=16 etc..once the nth fibonacci number you can do a similar search within the interval n/2 to n... Ofcourse using the golden ratios to get the nth fibonacci number May be not a practical solution...should think over it
-karthik On 1/20/07, Manish Garg <[EMAIL PROTECTED]> wrote: > > hi, > > i have one algo problem... > > what can be the fastest way to find the two fibonacci numbers around x. > say x is given to u then we have to find the two fibonacci numbers one is > less then or equal to x and other one is greater then x. > for exmple x =5 then output is 5 and 8..... > > -- > Manish Kumar Garg > M.Tech IIT Kharagpur, > 09732657489 > [EMAIL PROTECTED] > > > --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
