Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Solve the recurrence relation: $T(n)=T(n/4)+T(3n/4)+n$. Specify the best asymptotic running time.

share|improve this question
Hint: try $T(n) = c n \log n$ for appropriate constant $c$. –  Robert Israel Oct 18 '12 at 0:49
Welcome to math.SE: since you are new, I wanted to let you know a few things about the site. In order to get the best possible answers, it is helpful if you say in what context you encountered the problem, and what your thoughts on it are; this will prevent people from telling you things you already know, and help them give their answers at the right level. If this is homework, please add the homework tag; people will still help, so don't worry. Also, many find the use of imperative ("Prove", "Solve", etc.) to be rude when asking for help; please consider rewriting your post. –  Julian Kuelshammer Oct 18 '12 at 7:47
@Robert Israel: Your trying can find the particular solution part of the recurrence relation. –  doraemonpaul Aug 12 '13 at 5:03

1 Answer 1

This calls for the use of the Akra-Bazzi Method. Given that $T(n) = T(n/4) + T(3n/4) +n$, we have that $g(n)= n, a_1 = a_2 = 1,b_1= 1/4, b_2 = 3/4$.

We first need to solve for $p$ subject to $(1/4)^p + (3/4)^p = 1$ , giving $p= 1$.The method now gives $T(x) \in \Theta(f(x))$, where

\begin{align} f(x) = x^p (1+ \int _{[1,x]} \frac{g(u)}{u^{1+p}} du) \\ = x(1+ \log(x)) \end{align}

Thus $T(n) = \Theta(n \log(n))$.

share|improve this answer
That's really nice. I hadn't heard of that result. Thanks. –  marty cohen Oct 18 '12 at 1:42

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.