Asymptotic expansions for moments of number of comparisons used by the   randomized quick sort algorithm
  We calculate asymptotic expansions for the moments of number of comparisons used by the randomized quick sort algorithm using the singularity analysis of certain generating functions. 
Sumit Kumar Jha
cs.DS