some results on asymptotic behavior of the recalls of random median quicksort

This paper investigates the asymptotic behavior of the number of recalls  xn of the random median quicksort algorithm in order to sort a list of n distinct numbers. as  n→∞, we provide the asymptotics of the expectation and variance of the recalls. furthermore, by utilizing a refined version of the contraction method for degenerate limits, we show the limiting distribution of xn correctly normalized is gaussian. the theoretical results are demonstrated by a simulation study.