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?
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It only takes a minute to sign up.Sign up to join this community