Asymptotic bounds of $T(n) = T(n/2) + T(n/4) + T(n/8) + n$
This problem is given in "Introduction to Algorithms", by Thomas H. Cormen.
I have the answer to it, but I don't understand it.
The answer is, $T(n) = \Theta(n)$.
It would be really good if you can explain it using recursion tree.
No comments:
Post a Comment