It turns out the anonymous commentor from IISc was right. I can’t keep a blog and keep up with course work at IISc. So, somewhat unfortunately, I will have to put this blog into a hibernate mode.
I will try and post interesting things as and when possible, but I don’t see that happening too often in the near future.
Before I go, here is an interesting way of finding fibonacci numbers that I found in SICP.
The trick is to think of calculating one fibonacci number from the previous as a transformation of a vector in . We’re going from (a b) -> (b a+b). But this can be expressed as f’ = Af, where A is a 2×2 matrix and f is a vector. The trick now is to chain many of these transformations together, and then use the method of exponentiation by squaring to calculate the n-th power of A, giving us a method to calculate the n-th fibonacci number in O(log n) time.
Pretty cool, eh?
September 8, 2008 at 10:42 am |
Need to dig into gray cells to cover up the geay areas in understanding this method. The complexity of logn is very tempting.
October 5, 2008 at 2:54 pm |
you write pretty good
i too need to manage time for things apart from course work !
hope this blog is in hibernating mode until I finish reading all your earlier explorations