Hashing algorithms scramble data and create pseudo-uniform data distributions. Bucket algorithms operate on raw untransformed data which are partitioned into groups according to membership in equlsized dimensional hyperreo tangles, called cells or buckets. The bucket data structure is rather sensitive us, the distribution of the data. In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems, as well as on a variety of problems in computational geometry and operations research.
Read more at http://ebookee.org/Lecture-Notes-on-Bucket-Algorithms-Progress-in-Computer-Science-and-Applied-Logic-PCS_1249567.html#LmhGLZ23wcaRoWJu.99