I'm trying to find the explicit solution / sum of first n elements for the following sequence:
d(2) = 2 d(n) = d(n/2) + n*log2(n)
Can you help me to find out what kind of recursion is this and how can I find the explicit solution and the sum of the first n elements?
I've calculated the first few elements, and it goes like this:
2 + 8 + 24 + 64 + ....
(I've arrived here by trying to calculate the asymptotic running time of the bitonic sorting algorithm on a ring-connected parallel architecture, and this is the last part but I'm stuck with this equation)