We perform simulations in order to obtain information on the limit dis
tribution of the Quicksort algorithm. This distribution is also con el
ated to the external path length of a binary search tree. II trims out
that the lognormal distribution is a very good approximation Sor that
distribution. However, by exact and numerical calculation of some mom
ents lye shall demonstrate that these distributions are not the same.