How do we solve the recurrence $T(n) = 2T(n/3) + n\log n$?
Also, is it possible to solve this recurrence by the Master method?
How do we solve the recurrence $T(n) = 2T(n/3) + n\log n$?
Also, is it possible to solve this recurrence by the Master method?