title: How to solve the recursive complexity T(n) = T(n/4)+T(3n/4)+cn
body: <p>I am solving this recurrence using a recursion tree. The total cost of each level is n, and the depth of the tree is between <code>log (n) base 4</code> and <code>log (n) base 4/3</code>. Intuitively, I expect the solution to be at most the number of levels times the cost at each level. <code>O(cn log (n) base 4/3) = O(n log n)</code>. I was wondering if my approach towards the problem, and my solution is correct?</p>