Dashboard 🪄
Bubble sort
0 elements0 operations0.00s
Visualization
Status
Ready
Duration
0.00s
—
Operations
0
0 compares · 0 swaps
Progress
0%
Algorithm Info
Bubble Sort
Description
Bubble Sort repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Time Complexity
Best Case
O(n)
Average Case
O(n²)
Worst Case
O(n²)
Space Complexity
O(1)
In-place sorting
Properties
Stable
In-place
Maintains relative order of equal elements
Best Use Cases
Small datasets
Nearly sorted arrays
Educational purposes