Sorting algorithms
Pick one and race it against another on the same numbers. Every comparison, swap and write is shown and counted.
Bubble sort
Swaps neighbours until the largest values bubble to the end.
Insertion sort
Grows a sorted prefix by sliding each value into place.
Selection sort
Finds the smallest remaining value and moves it to the front.
Merge sort
Sorts each half, then merges the two sorted halves.
Quick sort
Partitions around a pivot, then sorts each side.
Heap sort
Builds a max heap, then moves the largest value to the end.