How many will you compute ?, to less may be of no use, very high then the time required may become more.....
On Jan 21, 2:41 pm, "cypressx" <[EMAIL PROTECTED]> wrote: > If the problem is with many queries , you can precompute all of the > fibonacci numbers you might need , and then do a binary search for X > every time you have a query. > > -- Yosif --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
