I stumbled on how to solve 4.3-6. Feel a bit ashamed but I found that the constant 17 is very difficult to remove. That includes some attempts of mine to subtract a lower terms.
I decided to leave this problem to "something to visit" in my status. During the time I might go ahead to look at different techniques of solving recurrence. There is something missing in my understanding/techniques.
This comment has been removed by the author.
ReplyDeleteI've just got it.
ReplyDeleteWatch the second video lecture from MIT:
http://www.catonmat.net/blog/mit-introduction-to-algorithms-part-one/
Use the idea of residual and the same reasoning line used by the professor on the class example: T(n) = 4T(n/2) + n
and you will get the right answer.
Hey Guys,
ReplyDeleteI am glad that you find the answer. Note, I will only post answer after I finish every 5 chapters. I also don't think it will include Chapter 4 since I found some of the exercises are beyond me.
Good Luck with your study.
33_P