Counting sort animated: build the count array, then emit values in order with zero comparisons — buckets shown live with narration.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Counting Sort Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Counting sort animated: build the count array, then emit values in order with zero comparisons — buckets shown live with narration. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Bubble Sort Visualizer: Bubble sort animated with bars that lift and slide past each other on every swap, colored comparison verdicts, and running pseudocode.
Open toolSorting Algorithm Visualizer: Watch bubble, selection, insertion, merge, quick, and heap sort run step by step — animated bars, comparison and write counters, plain-English narration, and complexity cards.
Open toolAlgorithm Academy: 35+ classic algorithms animated step by step — searching, counting/radix/bucket sort, dynamic programming tables, greedy, backtracking, KMP, graph algorithms, max flow, and convex hull — with auto-play, next/prev stepping, adjustable interval, and pseudocode that highlights the running line.
Open tool1Values are small integers (0..30) — count occurrences instead of comparing. Counting sort is O(n + k), no comparisons at all.
count = zeros(k+1)for v in a: count[v] += 1out = []for v = 0..k: emit v count[v] timesreturn out
Count occurrences of each small-integer value, then emit in order. Zero comparisons — beats the O(n log n) comparison bound by not comparing.
