@sravanreddy001
by matrix exponential method, we can calculate the nth fibonacci number in
logarithmic time.
On Mon, May 23, 2011 at 7:39 PM, anshu mishra <anshumishra6...@gmail.com>wrote:
> @sravanreddy001
> suppose u have to calulate A^n u can calculate in O(d^3*log(n));
> d is dimesion of matrixl
> while (n)
> {
> if (n&1) mul(ans, A, d);
> mul(A, A, d);
> n >>=1;
> }
>
>
> --
> Anshuman Mishra
> IIIT Allahabad
> -----------------
>
> anshumishra6...@gmail.com
> rit2007...@iiita.ac.in
>
> --
> 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.
>
--
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.
