Bucket sort, or bin sort, is a sorting algorithm that works by partitioning an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm. It is a distribution sort, and is a cousin of radix sort in the most to least significant digit flavour. Bucket sort is a generalization of pigeonhole sort. Since bucket sort is not a comparison sort, the Ω(n log n) lower bound is inapplicable. The computational complexity estimates involve the number of buckets.
Bucket sort works as follows:
- Set up an array of initially empty "buckets."
- Scatter: Go over the original array, putting each object in its bucket.
- Sort each non-empty bucket.
- Gather: Visit the buckets in order and put all elements back into the original array.
Read more about Bucket Sort: Pseudocode, Optimizations, Comparison With Other Sorting Algorithms
Famous quotes containing the words bucket and/or sort:
“And now, far removed from the loved habitation,
The tear of regret will intrusively swell,
As fancy reverts to my father’s plantation,
And sighs for the bucket that hung in the well.”
—Samuel Woodworth (1788–1842)
“Culture is a sham if it is only a sort of Gothic front put on an iron building—like Tower Bridge—or a classical front put on a steel frame—like the Daily Telegraph building in Fleet Street. Culture, if it is to be a real thing and a holy thing, must be the product of what we actually do for a living—not something added, like sugar on a pill.”
—Eric Gill (1882–1940)