Sorting Algorithms Visualizer
Current Step: Initializing...
Bubble Sort
Bubble Sort repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted.
Time Complexity: O(n²) | Space Complexity: O(1)
Comparisons
0
Swaps
0
Time Elapsed
0.0s
Array Accesses
0
Algorithm Controls
Color Legend
Unsorted
Comparing (i)
Comparing (j)
Pivot/Min/Key
Sorted