Bucket Sort Visualizer

Setup Array

Sort Controls

Array Visualization

Current Array:

Buckets (0.0-0.1, 0.1-0.2, ...):

Algorithm Steps

How to Use

Setup: Enter decimal numbers 0-1 separated by commas or click "Random"
Sort: Click "Start Sort" to begin the bucket sort process
Step Through: Click "Next Step" to see each step of the algorithm execution
Run Through: Click "Run Through" to automatically execute all steps in sequence
Observe: Watch elements being distributed and sorted in buckets
Reset: Click "Reset" to start over with a new sort

Colors: Orange = Distributing, Different Colors = Buckets, Yellow = Sorting, Green = Sorted

Bucket Sort Concept

Bucket Sort is a distribution sorting algorithm that distributes elements into buckets, sorts each bucket, then concatenates results.

How it works:

Create empty buckets for value ranges
Distribute elements into appropriate buckets
Sort each individual bucket (using insertion sort)
Concatenate sorted buckets to get final result
Works best with uniformly distributed data

Time Complexity: O(n + k) average, O(nÂ²) worst case

Use Cases

Uniformly Distributed Data: Optimal performance when input values are uniformly distributed across a known range
Floating-Point Sorting: Excellent for sorting decimal numbers (0.0 to 1.0) or normalized ranges
Large Datasets: O(n + k) average time complexity makes it efficient for sorting millions of items
External Sorting: Useful for sorting data too large to fit in memory by distributing to bucket files
Range Queries: Efficiently organize data for quick range-based queries and aggregations
Histogram Generation: Bucket distribution naturally creates histograms of data distribution
Parallel Processing: Buckets can be sorted independently, enabling multi-threaded or distributed sorting
Non-Comparison Sorting: Doesn't rely on comparison operations, suitable for special data types

Real-World Example

Scenario: A data analytics team sorts a large dataset of normalized customer satisfaction scores (0.0 to 1.0) collected from 10,000 survey responses to analyze satisfaction distribution by percentile ranges.

Input: 10,000 scores uniformly distributed between 0.0-1.0 (e.g., [0.72, 0.21, 0.89, 0.45, 0.61...])
Process: Distribute into 10 buckets (0.0-0.1, 0.1-0.2...0.9-1.0), sort each bucket with insertion sort, concatenate results
Output: Sorted scores grouped by satisfaction percentile ranges [0.02, 0.08, 0.11, 0.15...0.98, 0.99]

Bucket sort excels in this scenario because the data is uniformly distributed across a known range and the dataset is large. Quick sort would require O(n log n) operations, but bucket sort achieves O(n + k) with only 10 buckets. The algorithm naturally organizes data by satisfaction tiers, making it easy to analyze what percentage of customers fall into each satisfaction bracket. Each bucket is small enough that insertion sort within buckets is fast, while the overall process is parallelizable if needed.

Benefits: Linear average time O(n+k), efficient for uniform distribution, parallelizable buckets, natural histogram generation