Everything About ___
Live briefing

Everything about Bucket sort

Sorting algorithm

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 sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm. It is a distribution sort, a generalization of pigeonhole sort that allows multiple keys per bucket, and is a cousin of radix sort in the most-to-least significant digit flavor. Bucket sort can be implemented with comparisons and therefore can also be considered a comparison sort algorithm. The computational complexity depends on the algorithm used to sort each bucket, the number of buckets to use, and whether the input is uniformly distributed. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Bucket sortA 5-minute orientation
  2. Skim a recent paper: Enhancing Bucket Sort Efficiency: A Combinatorial Approach to Algorithm OptimizationInfluential work since 2022
  3. Pick up a classic book: The CardturnerThe most-reprinted book on the subject
  4. Read the landmark paper: An analysis and implementation of an efficient in-place bucket sortCited 13 times
  5. Go sideways: Proxmap sortA closely related topic
  6. Go sideways: Radix sortA closely related topic

📖 Definitions

Noun A sorting algorithm that partitions an array into a number of buckets (groups of elements) which are then individually sorted, either recursively or using some other algorithm.

🗂️ The subject at a glance

  1. Pseudocode
  2. Analysis
  3. Optimizations
  4. Variants
  5. Comparison with other sorting algorithms

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics