Skip to search formSkip to main contentSkip to account menu

Bucket sort

Known as: Range sort, Bucket array, Postman sort 
Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
American flag sortAnalysis of algorithmsArray data structureAsymptotically optimal algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Dynamic pressure analysis at chute flip buckets of five dam model studies
To dissipate energy and invert excessive discharge flow away from high dams into plunge pool, flip buckets are commonly designed… 
2008
2008
GPU Bucket Sort Algorithm with Applications to Nearest-neighbour Search
We present an adoption of the bucket sort algorithm capable of running entirely on GPU architecture. Our implementation employs… 
2007
2007
Numerical Simulation of the Flow in a Pelton Bucket by a Particle Method (2nd Repeat, Flow and Output Power of Runner at Off-Design Operating Points)
The flow in a rotating Pelton bucket is simulated by a Moving-Particle Semi-Implicit Method (MPS) under operating conditions of… 
2003
2003
Rangesum histograms
A <i>rangesum query</i> to an array <b>A</b> is a pair (<i>l, r</i>) of range endpoints, which should be answered by Σ<inf><i>l… 
2001
2001
A reconfigurable extension to the network interface of beowulf clusters
With a focus on commodity PC systems, Beowulf clusters traditionally lack the cutting edge network architectures, memory… 
1997
1997
The influence of geometry on dragline bucket filling performance
1997
1997
Optimal Bucket Sorting and Overlap Representations
  • Lin Chen
  • Parallel Algorithms Appl.
  • 1997
  • Corpus ID: 27791309
In this paper, we investigate the problems of sorting integers by bucket sort and of computing minimal interval and circular are… 
1996
1996
High-availability LH* schemes with mirroring
Mirroring is a popular technique for enhancing file availability. The authors incorporate this technique into the LH* algorithms… 
1992
1992
Dragline bucket filling
1986
1986
: Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem
The data dependent prefix problem is to compute all the n initial products x1⃝x2⃝...⃝xk, 1 ≤ k ≤ n, where the order is specified… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)