Loading...
Loading...
OPERATIONS
[1]0
ops.
SWAPS
[2]0
ops.
GETS
0
ops.
SETS
0
ops.
COMPARISONS
0
comp.
REAL TIME
0
ms
VISUAL TIME
0
sec
OPS PER MS
0
ops/ms
COMPS PER MS
0
comp/ms
[1] Sum of Swap, Get, Set and Comparison operations.
[2] Swap operations do not count as neither Get nor Set operations.
Bubble Sort
Bubble sort is a simple sorting algorithm that 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 no swaps are needed, which indicates that the list is sorted.
Read moreBubble sort is not a practical sorting algorithm because of its poor performance. It has a time complexity of O(n²) on average, which makes it inefficient on large data sets. However, bubble sort is a simple algorithm that is easy to understand and implement, which makes it a good choice for educational purposes and simple cases.
| Big O Notation | |||
|---|---|---|---|
| Time complexity | Space complexity | ||
| Worst | Average | Best | Worst |
| O(n^2) | Θ(n^2) | Ω(n) | O(1) |
Big O Notation defines the lower, average and upper bounds of an algorithm, where Time complexity determines the amount of operations, and Space complexity the amount of memory that can be used
