Sorting Algorithm Visualizer

Common questions

Which sorting algorithms are included?

The visualizer includes early-exit bubble sort, adjacent-swap insertion sort, minimum-selection sort, last-pivot Lomuto quicksort and max-heap heapsort. You can compare any two on the same input, or show one trace.

How are comparisons, swaps and writes counted?

Each value-to-value comparator call counts once. Loop and index checks do not count. An exchange of two different array positions is one swap and two main-array writes. Self-swaps, initial copying and temporary-variable assignments are excluded. These are educational counts, not timing benchmarks.

What does stable sorting mean?

A stable algorithm preserves the original relative order of equal values for every input. Original identities such as #2 and #6 make that order visible. Bubble and adjacent-swap insertion are stable here. Selection, quicksort and heapsort are not guaranteed stable, even when one input happens to preserve equal-value order.

How many swaps does reverse-order bubble sort make?

For five distinct values in reverse order, bubble sort makes ten swaps and twenty main-array writes in this implementation. It also makes ten value comparisons. You can load the reverse-five example and jump to the sorted output to verify the counts.

How does side-by-side playback work?

Each shared step advances each algorithm by one operation event; a finished trace holds its final frame. Playback interval controls viewing speed, not processor speed. Pause, step, rewind, scrub or edit to stop playback. Hiding the page pauses it automatically.

Can I generate repeatable arrays or export traces?

A seed from zero to 4,294,967,295 and a length from two to 64 generate the same integer array from -20 to 20. Manual arrays accept decimals between -1,000,000 and 1,000,000 with six decimal places. JSON export includes every frame, item identity, counter and algorithm convention, regardless of the visible step.

Does my input leave the browser?

No. Trace generation runs in a local cancellable worker with a 15-second timeout. Inputs and traces are not automatically saved. Timed-out or canceled builds do not display partial traces as complete.