O(n^2)
Bubble Sort
Repeatedly compares adjacent values and moves larger values toward the end.
StableIn-placeO(1)
Algorithms
Sorting Lab
One visual model for adjacent swaps, selected minimums, insertion shifts, merge writes, pivot partitions, and heap extraction.
Visualizer set
Choose an algorithm
O(n^2)
Selection Sort
Selects the smallest remaining value and places it at the front.
Not stableIn-placeO(1)
O(n^2)
Insertion Sort
Builds a sorted prefix by inserting each new value where it belongs.
StableIn-placeO(1)
O(n log n)
Merge Sort
Splits the array, sorts each half, then merges sorted halves.
StableExtra memoryO(n)
O(n log n)
Quick Sort
Partitions values around a pivot, then recursively sorts each side.
Not stableIn-placeO(log n)
O(n log n)
Heap Sort
Builds a max heap, then repeatedly extracts the largest value.
Not stableIn-placeO(1)
Growth
Quadratic growth becomes visible fast
Browser timing can be noisy, so this lab starts with theoretical operation counts. The shape is the concept.
n=8
64
n=16
256
n=32
1,024
n=64
4,096
n=128
16,384
n=256
65,536
Red: O(n^2)Blue: O(n log n)Green: O(n)