2 papers
math.PR2012
Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract)
Patrick Bindjeme, James Allen Fill
Using a recursive approach, we obtain a simple exact expression for the L^2-distance from the limit in Régnier's (1989) classical limit theorem for the number of key comparisons re…
math.PR2012
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)
Patrick Bindjeme, James Allen Fill
In a continuous-time setting, Fill (2010) proved, for a large class of probabilistic sources, that the number of symbol comparisons used by QuickSort, when centered by subtracting…