Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.376
In a bucket sorting algorithm, the key to increase bucket sorting efficiency is how to uniformly distribute records into each "bucket". The data collected from empirical studies usually follow a certain probability distribution in a certain interval. To sort this kind of data, this paper proposed an innovative method through constructing a hash function based on its probability density function. Then n records can be allocated into n buckets uniformly according to the value of their key, which enables the sorting time of the proposed bucket sorting algorithm to reach O(n) under any circumstance.
Bucket Sorting, algorithm, Probability Distribution
Zhongxiao Zhao, Chen Min, "An Innovative Bucket Sorting Algorithm Based on Probability Distribution", Computer Science and Information Engineering, World Congress on, vol. 07, no. , pp. 846-850, 2009, doi:10.1109/CSIE.2009.376