Sorting Algorithm Visualizers

Walk through the array and swap any neighbors that are out of order. After each pass, the largest remaining value has bubbled to the end.

Find the smallest value in the unsorted part and swap it to the front. Repeat until nothing is left.

Keep the left part sorted. Take the next value (the key) and slide it left past every bigger value.

Insertion sort, but first on values that are gap apart. Big gaps move far-away values quickly; the last pass with gap 1 is a normal insertion sort on an almost sorted array.

Split the array in half until each piece has one value, then merge the pieces back together in order.

Pick a pivot, move smaller values to its left and bigger ones to its right, then sort each side the same way.

Turn the array into a max-heap so the biggest value sits at index 0. Swap it to the end, shrink the heap by one, and repair it. Repeat.

No comparisons at all. Count how many times each value appears, then write the values back from smallest to largest.

Sort by the ones digit, then by the tens digit, keeping ties in their previous order. After the last digit the whole array is sorted, without comparing two values.