This week Danny Heap did a lot of examples of unwinding recursive functions. I find the whole
concept of unwinding very interesting, and I think it is a very useful tool for finding (if possible) a closed-form formula and estimating the time complexity of a given function. I found the example of unwinding the zpf(n) function especially interesting. T(n) of zpf(n) had connections to the Fibonacci
sequence, and the whole process of deriving T(n)=2F(n+1)-1 was very captivating.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment