Analytic Variations on Bucket Selection and Sorting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

Analytic Variations on Bucket Selection and Sorting

Hosam Mahmoud
  • Function : Author
Philippe Flajolet
  • Function : Author
  • PersonId : 829512
Philippe Jacquet
Mireille Regnier
  • Function : Author
  • PersonId : 833582


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 there in) 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 luctuations appear in the moments of both the selection and sorting algorithms.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3399.pdf (391.82 Ko) Télécharger le fichier

Dates and versions

inria-00073290 , version 1 (24-05-2006)


  • HAL Id : inria-00073290 , version 1


Hosam Mahmoud, Philippe Flajolet, Philippe Jacquet, Mireille Regnier. Analytic Variations on Bucket Selection and Sorting. [Research Report] RR-3399, INRIA. 1998. ⟨inria-00073290⟩
162 View
177 Download


Gmail Facebook X LinkedIn More