Asymptotic expansions of the mergesort recurrences

Abstract. This note provides exact formulae for the mean and variance of the cost of top-down recursive mergesort. These formulae improve upon earlier results of Flajolet and Golin.

[1]  W. Burnside.  Theory of Functions , 1899, Nature.

[2]  Hsien-Kuei Hwang,et al.  Limit theorems for mergesort , 1996, Random Struct. Algorithms.

[3]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .