Skip to content

Commit d00a6c1

Browse files
[pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
1 parent 33488db commit d00a6c1

1 file changed

Lines changed: 3 additions & 3 deletions

File tree

sorts/bubble_sort.py

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -3,9 +3,9 @@
33

44
def bubble_sort_iterative(collection: list[Any]) -> list[Any]:
55
"""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-
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+
99
Time COmplexity:
1010
Worst Case: O(n^2)
1111
Average Case: O(n^2)

0 commit comments

Comments
 (0)