Top-Down Mergesort Analysis
lTmerge(n) = cnTime to merge two lists of length n/2
lTsplit(n) = dnTime to split a list of length n
lTsort(1) = 1;
lTsort(n) = Tsplit(n) + 2 Tsort(n/2) + Tmerge(n)
 
= 2 Tsort(n/2) + en
where e = c+d