Sorting Algorithms
Explore interactive visualizations of fundamental sorting algorithms. Each algorithm has its own dedicated page with detailed explanations, step-by-step visualization, and pseudocode walkthroughs.
Choose an Algorithm
Bubble Sort
Simple comparison-based algorithm that repeatedly steps through the list, comparing adjacent elements and swapping them if needed.
Insertion Sort
Builds the sorted array one item at a time by inserting each element into its correct position among previously sorted elements.
Selection Sort
Repeatedly finds the minimum element and places it at the beginning. Makes fewer swaps than other simple sorts, efficient when writes are expensive.
Merge Sort
Efficient divide-and-conquer algorithm that splits the array into halves, recursively sorts them, and merges the results.
Quick Sort
Fast partition-based algorithm that selects a pivot element and partitions the array around it, recursively sorting subarrays.
Heap Sort
Efficient heap-based algorithm guaranteed O(n log n) performance. Builds a max heap, then repeatedly extracts the maximum element.