Sorting Algorithms Visualizer
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Start Sort
Pause
Reset Data
Slow
Normal
Fast
Very Fast
Unsorted
Comparing
Selected/Pivot
Sorted
Comparisons: 0
Swaps: 0
Steps: 0
Bubble Sort:
Repeatedly steps through the list, compares adjacent elements and swaps them if they're in wrong order. Time complexity: O(n²)