A new approach to bucket sort

Authors:
Burak Takmaz;Murat Akin
Affiliations:
Institute of Sciences, Galatasaray University, Istanbul, Turkey;Institute of Sciences, Galatasaray University, Istanbul, Turkey
Venue:
SEPADS'08 Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
Year:
2008

Citing 5
Cited 0

A transition from bubble to shell sort

SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Empirical study of the expected running time for shellsort

The Computer Journal - Special issue on term rewriting
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Introduction to Algorithms

Introduction to Algorithms
Sorting in linear time - variations on the bucket sort

Journal of Computing Sciences in Colleges

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Bucket Sort has been one of the simplest distribution sorts and the Shell Sort (presented in 1959 by Donald L. Shell) has been one of the oldest sort methods until now. Although we cannot change their complexities, we determined that some improvements on the bucket sort can be made by different implementation mechanisms. In this paper, we mixed the bucket sort and shell sort. This new approach has worked with greater performance than the standard bucket sort algorithm.