This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
An Innovative Bucket Sorting Algorithm Based on Probability Distribution
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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:
Zhongxiao Zhao, Chen Min, "An Innovative Bucket Sorting Algorithm Based on Probability Distribution," csie, vol. 7, pp.846-850, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.