We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 33488db commit d00a6c1Copy full SHA for d00a6c1
1 file changed
sorts/bubble_sort.py
@@ -3,9 +3,9 @@
3
4
def bubble_sort_iterative(collection: list[Any]) -> list[Any]:
5
"""Pure implementation of bubble sort algorithm in Python.
6
- Bubble sort repeatedly steps through the list, compares adjacent elements, and swaps them
7
- if they are in the wrong order. This process is repeated until the list is sorted.
8
-
+ Bubble sort repeatedly steps through the list, compares adjacent elements, and swaps them
+ if they are in the wrong order. This process is repeated until the list is sorted.
+
9
Time COmplexity:
10
Worst Case: O(n^2)
11
Average Case: O(n^2)
0 commit comments