Computer Science and Information Engineering, World Congress on (2009)

Los Angeles, California USA

Mar. 31, 2009 to Apr. 2, 2009

ISBN: 978-0-7695-3507-4

pp: 846-850

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.376

ABSTRACT

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.

INDEX TERMS

Bucket Sorting, algorithm, Probability Distribution

CITATION

Z. Zhao and C. Min, "An Innovative Bucket Sorting Algorithm Based on Probability Distribution,"

*2009 WRI World Congress on Computer Science and Information Engineering, CSIE(CSIE)*, Los Angeles, CA, 2009, pp. 846-850.

doi:10.1109/CSIE.2009.376

CITATIONS