The recurrence relation for the algorithm is an eccentric form that has an additional term: $T(n) = T[\frac{n}{2}] + T[\frac{7n}{10} + 6] + n$. Exactly how can I prove that this recurrence relation leads to O(n) time complexity? The two common methods are iterative substitution and the master method however neither can be obviously applied.
Asked
Active
Viewed 37 times
