Sorting Algorithms
Interactive visualizations of different sorting techniques
Bubble Sort
Simple comparison-based sorting algorithm
Time Complexity: O(n²)
ElementaryComparison-based
Visualize
Merge Sort
Efficient, stable, divide-and-conquer algorithm
Time Complexity: O(n log n)
EfficientDivide & Conquer
Visualize
Quick Sort
Fast divide-and-conquer algorithm with partitioning
Time Complexity: O(n log n)
EfficientDivide & Conquer
Visualize
Insertion Sort
Simple algorithm that builds sorted array one item at a time
Time Complexity: O(n²)
ElementaryOnline
Visualize
Selection Sort
Simple algorithm that selects smallest element in each pass
Time Complexity: O(n²)
ElementaryIn-place
Visualize