摘要: The divide-and-conquer principle is a major paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used in algorithm. This work shows periodicity phenomena, often fractal nature, are ubiquitous performances these algorithms. Mellin transforms and Dirichlet series to attain precise asymptotic estimates. method illustrated by detailed average case, variance distribution analysis classic top-down recursive mergesort