Watch bubble, selection, insertion, merge, quick, and heap sort run step by step — animated bars, comparison and write counters, plain-English narration, and complexity cards.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Sorting Algorithm Visualizer animates bubble, selection, insertion, merge, quick, and heap sort on bars that physically slide past each other when they swap. Every comparison shows a colored TRUE/FALSE verdict, the pseudocode highlights the running line, and live counters track comparisons and writes — so the O(n²) vs O(n log n) difference stops being abstract.
1Is a[0]=53 > a[1]=100? FALSE — already in order.
for end = n-1 down to 1:for i = 0 to end-1:if a[i] > a[i+1]:swap(a[i], a[i+1])a[end] is now sortedarray fully sorted
Repeatedly walks the array, swapping adjacent out-of-order pairs. After each pass the largest remaining value has 'bubbled' to its final slot at the end.
