Problem: Inspiring by the following post, I wonder how to solve the recurrence $$ T(n) = 2T(n/2) +\mathcal{O}(n\log n).$$
I had just thought about this question already when I saw the above post. I hope everyone can give me some ideas about this extension version.