Abstract.
We provide complete average-case as well as probabilistic analysis of the cost of bucket selection and sorting algorithms. Two variations of bucketing (and flavors therein) are considered: distributive bucketing (large number of buckets) and radix bucketing (recursive with a small number of buckets, suitable for digital computation). For Distributive Selection a compound Poisson limit is established. For all other flavors of bucket selection and sorting, central limit theorems underlying the cost are derived by asymptotic techniques involving perturbation of Rice's integral and contour integration (saddle point methods). In the case of radix bucketing, periodic fluctuations appear in the moments of both the selection and sorting algorithms.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 14 April 1998 / 9 November 1999
Rights and permissions
About this article
Cite this article
Mahmoud, H., Flajolet, P., Jacquet, P. et al. Analytic variations on bucket selection and sorting. Acta Informatica 36, 735–760 (2000). https://doi.org/10.1007/s002360050173
Issue Date:
DOI: https://doi.org/10.1007/s002360050173