Bucket Sort Visualizer

Visualize Bucket Sort distributing values, sorting buckets, and gathering results with interactive playback and operation insights.

Sending the highlighted value to bucket 1.

Array values

Comma-separated numbers, up to 20 values.

Playback speedBalanced

Live operation

distribute

Step 1 / 20

[0]

[1]

[2]

[3]

[4]

[5]

[6]

[7]

Distribute valueActive bucketMerge outputSorted

Distribution buckets

bucket 0

bucket 1

bucket 2

Merged output

Waiting for merge…

Comparisons

Moves / writes

Confirmed sorted

0 / 8

Algorithm notes

What to watch for

Bucket Sort works best when input values are spread fairly evenly across a known range. Good distribution keeps individual buckets small and cheap to sort.

Bucket Sort Complete Info Card

Scatter-GatherDistribution Based

Bucket Sort works by distributing elements into multiple buckets, sorting individual buckets (typically using another algorithm), then combining results. Ideal for uniformly distributed data like floating-point numbers.

Algorithm Characteristics

Time Complexity (Best)

Uniform element distribution

O(n + k)

Time Complexity (Average)

Balanced bucket sizes

O(n + n²/k)

Time Complexity (Worst)

All elements in one bucket

O(n²)

Space Complexity

Bucket storage + sorting

O(n + k)

Stable

Based on internal sort used

Depends

In-Place

Requires auxiliary buckets

Sorting Process Steps

Create empty buckets (array of lists)

Calculate bucket range from max value

Distribute elements into buckets

Sort individual buckets (e.g., Insertion Sort)

Concatenate sorted buckets

Key Features & Trade-offs

Feature	Advantages	Considerations
Uniform Distribution	Optimal performance	Requires known data distribution
Bucket Count	More buckets = better performance	Memory trade-off
Hybrid Approach	Combines scatter-sort-gather	Multiple algorithms involved
Floating Points	Excellent for [0,1) range	Needs value normalization
Adaptive	Adjusts to data characteristics	Requires careful tuning

Optimal Use Cases

•Uniformly distributed floating-point numbers
•When data characteristics are known
•External sorting scenarios

When to Avoid

•Non-uniform data distributions
•Small datasets (overhead not justified)
•Memory-constrained environments

Pro Tip: Bucket Sort's efficiency peaks when the number of buckets (k) ≈ number of elements (n). Use Insertion Sort for individual buckets when dealing with small bucket sizes.

Distribution SortAdaptiveHybrid Approach