Substitution method to prove the recurrence in quick sort - Use the substitution method to prove that the recurrence:
T(n) = T(n-1) + theta(n) has the solution T(n) = theta(n2). Please note that this question is in quick sort assignment.
Big O Problem - Consider the recurrence
T(1)=a
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 = ...
Solving a recurrence - Using the same method in attachment #1, solve the recurrence in attachment #2.
I increased the bid to 6 credits, but also could you repost the Rucurrence running time problem (MasterTheorem.doc) in ...