Recursionmedium
0:00.0

A function T(n)T(n) is defined by T(n)=2T(n2)+nT(n) = 2T(\frac{n}{2}) + n. According to the Master Theorem, what is the asymptotic complexity O(f(n))O(f(n))?