How to solve the recurrence relation:
T(n) = T(n - 1) + T(n / 2)+ n
by recursion tree to get an asymptotic upper bound?
The height is n, but how to generalize the sum at each levels?
How to solve the recurrence relation:
T(n) = T(n - 1) + T(n / 2)+ n
by recursion tree to get an asymptotic upper bound?
The height is n, but how to generalize the sum at each levels?