DSAverse

Sorting Algorithms

Loading Sorting Algorithms...

Sorting Visualization

n = 8 elementscomparing...

Back to Sorting

Radix Sort Visualizer

Watch how Radix Sort uses non-comparison based sorting by processing individual digits from least to most significant.

Time: O(d × (n + k))

Space: O(n + k)

Stable: Yes

Non-comparison

Animation Speed: 1200ms

Fast (600ms)Slow (3000ms)

Progress: Step 1 of 0Pass 0 of 0 | Digit: units

Current Array

Buckets (0-9)

Bucket 0

Bucket 1

Bucket 2

Bucket 3

Bucket 4

Bucket 5

Bucket 6

Bucket 7

Bucket 8

Bucket 9

Array Elements

Currently Processing

Active Bucket

Sorted

Current Step

Click Play to begin the Radix Sort visualization

Algorithm Details

Time:O(d×(n+k))

Space:O(n + k)

Stable:Yes

In-place:No

Type:Non-comparison

d = number of digits

n = number of elements

k = range of input (10 for decimal)

When to Use Radix Sort

Sorting integers with fixed number of digits
When n is large and d is small
Sorting strings of equal length
Floating-point numbers
Variable-length strings
Memory-severely-limited environments

Knowledge Check

Question 1 of 3

Is Radix Sort a comparison-based sorting algorithm?

DSAverse

Sorting Algorithms

Loading Sorting Algorithms...

Sorting Visualization

n = 8 elementscomparing...