@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.
