Time Complexity of T(xn) + T((1 − x)n) + cn

Question

What is the time complexity of the recurrence relation T(xn) + T((1 − x)n) + cn

What is the range of $x$? $0<x<1$ I suppose? – A.Schulz Oct 09 '13 at 07:14 — A.Schulz, Oct 09 '13 at 07:14

score 2 · Answer 1 · answered Oct 09 '13 at 03:41

2

The Akra-Bazzi theorem shows that the solution is $\Theta(n\log n)$. Details left to you.

answered Oct 09 '13 at 03:41

Yuval Filmus

1 Answers1