Big O problem
Not what you're looking for? Search our solutions OR ask your own Custom question.
This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!
Consider the recurrence
T(n)=cT(n/d)+bn^k, for n a power of d
Iteratively expand T(n) in terms of T(n/d^i) for i=1,2,.... Show that
a) if c > d^k, then T(n) is O(n^logd c)
b) if c = d^k, then T(n) is O(n^k log n)
c) if c < d^k, then T(n) is O(n^k)
This solution helps with a software development problem.