- Executors
-
Learn
Python Learning Hub Runnable examples, NumPy, pandas, and more C & C++ Learning Hub Pointers, memory, STL, and modern C++ C# Learning HubC# basics, OOP, LINQ, async, and .NET exercises Python Algorithms Search, sorting, recursion, and visualizers O(n) C & C++ Algorithms Compare algorithms implemented in C and C++
- Challenges
Visualizers
Sorting Algorithm Visualizer
See how classic sorting algorithms work, one comparison and swap at a time.
- Runs in your browser
- Instant results
- Free, no sign-up
Loading the tool…
How to use the Sorting Algorithm Visualizer
- Choose an algorithm, the number of elements and the starting data.
- Press Play, or Step to go one operation at a time.
- Compare comparisons, swaps and the complexity table between algorithms.
Frequently asked questions
Which sorting algorithm is fastest?
On random data, quick, merge and heap sort (O(n log n)) beat the O(n²) sorts. Insertion sort wins on nearly sorted data.
What does stable mean?
A stable sort keeps equal values in their original order, which matters when sorting records by one field.
Why try different starting data?
Some algorithms behave very differently on sorted, reversed or repetitive input; quick sort's worst case shows on sorted data.
Practice Python with coding challenges
Solve hands-on problems right in this editor: run the sample tests, submit, and get an AI code review.