I wonder how could I solve the recurrence relation when I calculate complexities. Let me explain it via an example:
$T(n)=2T(n/2) +n$. Solve this recurrence relation.
I know from the Master theorem that it has a $\Theta(n \log n)$ complexity. However,I don't want to get only complexity but also equation like $T(n)=\ldots$.
Is there anyone to help me?
Thanks in advance.