DSAverse

Initializing Sorting Algorithms...

Sorting

Trees

Graphs

Preparing interactive visualizations...

Cheatsheet Contact

DSAverse

Sorting Algorithms

Loading Sorting Algorithms...

Sorting Visualization

n = 8 elementscomparing...

DSAverse

Making data structures and algorithms accessible through interactive visualizations.

Quick Links

Home
Contact

Categories

Sorting
Searching
Dynamic Programming

More

Basics
Recursion
Heap Structures
Two Pointers & Sliding Window

© 2025 DSAverse. Built withfor better learning.

Back to Sorting

Bucket Sort Visualizer

Watch how Bucket Sort distributes elements into buckets, sorts each bucket individually, and concatenates them for the final result.

Time: O(n + k) avg

Space: O(n + k)

Stable: Yes

Distribution-based

Animation Speed: 1200ms

Fast (600ms)Slow (3000ms)

Progress: Step 1 of 0Phase: start | Buckets: 3

Current Array

64

0

34

1

25

2

12

3

22

4

11

5

90

6

Buckets

Bucket 0

Empty

Bucket 1

Empty

Bucket 2

Empty

Array Elements

Currently Processing

Active Bucket

Sorting Bucket

Sorted

Current Step

Click Play to begin the Bucket Sort visualization

Algorithm Details

Best Case:O(n + k)

Average Case:O(n + k)

Worst Case:O(n²)

Space:O(n + k)

Stable:Yes

In-place:No

n = number of elements

k = number of buckets

When to Use Bucket Sort

Uniformly distributed data
Known range of input values
Floating-point numbers in [0,1)
Skewed or clustered data distribution
Unknown or very large value ranges
Memory-constrained environments

Knowledge Check

Question 1 of 3

When does Bucket Sort achieve its best O(n + k) performance?