2007 | OriginalPaper | Buchkapitel
Adaptive Processing Scheme of Overflowed Buckets for Bucket Sort Algorithm
verfasst von : Peng Liu, Yu-ping Ma, Jian-she Dong
Erschienen in: Theoretical Advances and Applications of Fuzzy Logic and Soft Computing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Bucket sort algorithm is an effective approach to sort very large files, whereas the probability of bucket overflow hinders its efficiency. The paper puts forward a more effective bucket sort algorithm, THShort2, which subtly handles the overflowed buckets. For a different degree of bucket overflow, we propose a corresponding processing scheme. The correctness and efficiency of THShort2 is proofed theoretically. The experiment results show that the performance of THSort2 is about triple times of NTSort, and 50% faster than THSort.