Sorting

Watch sorting algorithms run one operation at a time: which values get compared, which ones swap, and how the array settles into order.

Visualisations

Bubble Sort

Watch bubble sort compare adjacent pairs and swap until the largest value reaches the end. Step through it one comparison at a time, or try your own numbers.

avgO(n²)spaceO(1)stableyes
Open visualiser

Side by side

AlgorithmBestAverageWorstSpaceStable
Bubble SortO(n)O(n²)O(n²)O(1)Yes