2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/59268Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere positive and infinitely differentiable density f, and that each derivative f^{(k)} enjoys superpolynomial decay at plus and minus infinity. In particular, each f^{(k)} is bounded. Our method is sufficiently computational to prove, for example, that f is bounded by 16.11 pages. Refereed article, to apppear in a book edited by D. Gardy and A. Mokkadem and published in 2000 by BirkhauserProbabilityData Structures and Algorithms68W40 (primary), 68P10, 60E05, 60E10 (secondary)Smoothness and decay properties of the limiting Quicksort density functiontext