Cart (Loading....) | Create Account
Close category search window
 

An Innovative Bucket Sorting Algorithm Based on Probability Distribution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhongxiao Zhao ; Dept. of Comput. & Inf. Sci., Fujian Univ. of Technol., Fuzhou, China ; Chen Min

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.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:7 )

Date of Conference:

March 31 2009-April 2 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.