Sorting Visualizer
See how sorting algorithms actually work. Watch bubble, insertion, selection, and quicksort race through an array, comparison by comparison.
Sorting Algorithm VisualizerLive
watch algorithms sort in real time
Controls
Data Inspector
Algorithmquick
Elements60
ComplexityO(n log n) avg
Governing equation
Reading this result: Quicksort partitions around a pivot and recurses, averaging O(n log n) — on 60 elements it makes far fewer comparisons than the quadratic sorts.
Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.
★ Sign in to save this setupSave your tuned setup, or drop this simulation into your own site, docs, or course page.
How it works
Each algorithm's comparisons and swaps are recorded step by step and replayed as animated bars. It's the fastest way to feel the difference between an O(n²) sort and quicksort's O(n log n) average — and to see why the same data takes wildly different paths.
✦
Ask the AI about this model
The math, the assumptions, real-world uses, or a code translation — explained for this exact simulation.
Related live simulations
Frequently asked questions
Is this sorting algorithm visualizer tool really free?▾
Yes. Sorting Visualizer runs entirely in your browser using your device's own compute, so local use is free forever. You only pay Compute Tokens if you scale a job to the cloud.
Do I need to install anything?▾
No. Everything runs client-side in a modern browser — no downloads, no license, no account required to start.
Can I save or share my simulation?▾
Create a free account to save projects, and use a shareable embed or minted DOI to publish a live, interactive version anywhere.
How accurate are the results?▾
The solver uses established numerical methods, but results are for research and educational purposes and should be validated against experiment or professional review before you rely on them.