Sorting Algorithms Visualizer

Bubble Sort

Compares adjacent elements and swaps them if they're in the wrong order.

Selection Sort

Finds the smallest element in the array and places it at the front.

Insertion Sort

Builds the sorted array by inserting elements in their correct position.

Merge Sort

Divides the array, sorts them, and merges them back together.

Quick Sort

Uses a pivot to partition the array and sorts each partition.

Heap Sort

Transforms the array into a heap structure and sorts it.

Radix Sort

Sorts numbers by processing individual digits from least to most significant.

Shell Sort

Sorts elements by comparing elements at a gap and reducing the gap over time.

Summary

Summary of all the sorting algorithms their worst, average and best case complexities in one table.