Interactive DSA and system design

Learn complex engineering ideas by watching them move.

48stepsO(nk)averageO(n + k)space

Sorting lab

Radix Sort Digit-by-Digit Flow

Step 1 / 48

Comparing Pivot / Mid Swapping Sorted / Found Active Range

Animation speed

Space play / pause←→ stepR reset

Current operation

Start

Radix Sort begins. The largest value is 96 which has 2 digits. We will do 2 counting-sort passes (LSD first).

Try your own input

Use 3-12 positive numbers separated by commas.

Complexity notes

O(nk)averageO(nk)worstO(n + k)spaceYesstable

Synced code trace

function radixSort(arr) {  for (let exp = 1; max/exp >= 1; exp *= 10) {    countingSortByDigit(arr, exp);  }}function countingSortByDigit(arr, exp) {  // count, cumulate, place, copy back}

Interactive Notes

✓ Notes are saved automatically and persist per step.