Sorting Algorithms
Sorting Algorithms
Start with a simple comparison sort and watch how adjacent elements gradually move into ascending order.
Browse algorithm categories
This section will grow over time. For now, Bubble Sort and Quick Sort are available as the first interactive demos.
Bubble Sort
A step-by-step visualization of Bubble Sort with code, controls, and a clear explanation of the core idea.
Quick Sort
A divide-and-conquer visualization that shows how the array is partitioned around a pivot.
Insertion Sort
A visualization of how each new element is inserted into an already sorted prefix.
Selection Sort
A visualization of how the smallest remaining element is selected and moved into place.
Merge Sort
A divide-and-conquer visualization showing how smaller sorted fragments are merged into a final result.
Shell Sort
A gap-based visualization that improves insertion sort by moving distant elements earlier.
Heap Sort
A visualization of heap construction and repeated extraction of the largest element.