What is the solution to the recurrence formula T(n)=2T(n2)+O(n)? Which of the O(n) items represent? 归并排序时间复杂度的递推公式T(n)=2T(n2)+O(n)的解是什么?其中O(n)项代表什么?
AO(n), time for merging two sorted subvectors O(n),归并两个已排序子向量的时间
BO(nlog2n), the time for sorting two sub-vectors separatelyO(nlog2n),对两个子向量分别进行排序的时间
CO(n2), the time for sorting two sub-vectors separatelyO(n2),对两个子向量分别进行排序的时间
DO(nlog2n), time for merging two sorted subvectorsO(nlog2n),归并两个已排序子向量的时间