Sorting Algorithm Race Screensaver
The Sorting Algorithm Race screensaver runs four real classic sorting algorithms live side by side on the same shuffled data, with real comparison and swap counts. It is free, runs in your browser, and ESC exits.
How the Sorting Algorithm Race screensaver works
The saver runs real, correct implementations of bubble sort, insertion sort, selection sort and quicksort, each on its own identical copy of a shuffled array.
Every algorithm advances one real step per frame, so you watch their true relative speed and behavior side by side.
Real running counters track each algorithm's comparisons and swaps as it works.
Once every algorithm finishes, the data reshuffles and a fresh race begins.
A worked example
Quicksort typically finishes first with far fewer real comparisons than bubble sort, exactly illustrating the real algorithmic complexity difference between them.
Settings & tips
- Accent recolours the active comparison bars.
- All four algorithms are real, correct, unmodified implementations.
- A fresh shuffle starts automatically once every race finishes.
Frequently asked questions
- Are these real sorting algorithms?
- Yes — real, correct implementations of bubble, insertion, selection sort and quicksort.
- Is a key needed?
- No — it is a pure local computation.
- Is it free?
- Yes — free, no download, in your browser.
- Why does quicksort usually win?
- Its real average-case complexity is faster than the simpler algorithms it races against.