Sorting Algorithm Visualizer

Simple algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

Simple sorting algorithm that repeatedly finds the minimum element from the unsorted part and puts it at the beginning.

Builds the sorted array one item at a time by comparisons. Efficient for small data sets or nearly sorted arrays.

Efficient, stable, divide-and-conquer algorithm. Divides array in half, sorts each half, then merges them.

Divide-and-conquer algorithm that selects a pivot, partitions the array, and recursively sorts the partitions.

Generalization of insertion sort that allows the exchange of items that are far apart, then progressively reduces the gap.

Non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by digits.

Integer sorting algorithm that works by counting the occurrences of each unique element in the array.

Algorithm specifically designed for sorting a range of numbers, placing each number in its correct position.

Comparison-based sorting algorithm that uses a binary heap data structure. Builds a max heap and repeatedly extracts the maximum element.

Distribution sort that divides the elements into buckets and then sorts each bucket individually, often with another algorithm.