Visualizations

Repeatedly swaps adjacent elements if they are in wrong order until the largest values bubble to the end.

Passes through the array in both directions, pushing large values to the end and small values to the start each round.

Repeatedly finds the smallest remaining element and swaps it into the next position until the whole array is sorted.

Takes each element in turn and shifts larger values right until it can drop into its place, like sorting a hand of cards.

Walks forward while neighbours are in order and steps back, swapping, whenever they aren't, until it reaches the end.

Compares and swaps elements a shrinking gap apart, moving far-off values quickly before finishing with neighbours.

Splits the array into halves, sorts each half, and merges them back together through an auxiliary array.

Checks each value from left to right until it finds the target or reaches the end of the array.

Picks a pivot, moves smaller values to its left and larger ones to its right, then sorts each side the same way.

Places the target at the end of the array as a sentinel, so the scan can skip its bounds check and stop only on a match.

Checks the middle of a sorted array and discards the half that can't hold the target until it finds it or runs out of values.

Checks two points that split a sorted array into thirds and keeps only the third that can still hold the target.

Jumps ahead through a sorted array in fixed-size blocks, then scans the one block that can hold the target.

Estimates where the target should be from its value, like opening a dictionary near the right letter, and narrows in from there.

Doubles its reach (1, 2, 4, 8, …) through a sorted array until it passes the target, then binary searches the range it skipped.

Splits a sorted array at Fibonacci numbers instead of halves, narrowing the range using only addition and subtraction.