can be found in lg(n) using Matrix Exponential method
| 1 1 |^n
| 1 0 |
[f(i) f(i-1)]* |1 1| = [f(i+1) f(i)]
|1 0|
On Fri, Jul 29, 2011 at 12:05 PM, Reynald <[email protected]> wrote:
> Write and implement an algorithm to find the nth Fibonacci number,
> optimized for space and time.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected].
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Sunny Aggrawal
B-Tech IV year,CSI
Indian Institute Of Technology,Roorkee
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
