Radix Sort Visualizer

Setup Array

Sort Controls

Array Visualization

Current Array:

Buckets (Digit: 1):

Algorithm Steps

How to Use

Setup: Enter numbers separated by commas or click "Random" to generate an array
Sort: Click "Start Sort" to begin the radix 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 sorted by each digit position
Reset: Click "Reset" to start over with a new sort

Colors: Orange = Current Digit, Different Colors = Buckets 0-9, Green = Sorted

Radix Sort Concept

Radix Sort is a non-comparison sorting algorithm that sorts numbers by processing individual digits from least to most significant.

How it works:

Find maximum number to determine digit count
Sort by each digit position (units, tens, hundreds)
Use counting sort for each digit (0-9)
Distribute elements into buckets by digit value
Collect elements from buckets in order

Time Complexity: O(d × (n + k)) where d is digits, k is range

Radix Sort Code Implementation

ALGORITHM RadixSort
INPUT: Array A of n non-negative integers
OUTPUT: Sorted array A

BEGIN
    max_val = maximum value in A
    exp = 1
    
    WHILE max_val / exp > 0 DO
        CountingSort(A, exp)
        exp = exp * 10
    END WHILE
END

COUNTINGSORT(A, exp)
    Create count array of size 10, initialize to 0
    Create output array of size n
    
    FOR each element A[i] DO
        digit = (A[i] / exp) % 10
        count[digit] = count[digit] + 1
    END FOR
    
    FOR i = 1 TO 9 DO
        count[i] = count[i] + count[i-1]
    END FOR
    
    FOR i = n-1 DOWN TO 0 DO
        digit = (A[i] / exp) % 10
        output[count[digit] - 1] = A[i]
        count[digit] = count[digit] - 1
    END FOR
    
    Copy output back to A
END

Rate This Learning Tool

Clarity of Visualization:

★ ★ ★ ★ ★

Interactivity:

★ ★ ★ ★ ★

Educational Value:

★ ★ ★ ★ ★

Performance:

★ ★ ★ ★ ★

Intuitivity & Usability:

★ ★ ★ ★ ★

Overall Evaluation:

★ ★ ★ ★ ★

Comments:

© 2025 TEC-Bridge AI. All rights reserved. | Contact: contact@tec-bridge.ai | https://tec-bridge.ai