Skip to content

sorts: add complexity analysis to bubble sort docstrings #14601

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
Kcstring wants to merge 1 commit into from
+18 −0
Closed

sorts: add complexity analysis to bubble sort docstrings #14601

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 18 additions & 0 deletions sorts/bubble_sort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,6 +8,15 @@ def bubble_sort_iterative(collection: list[Any]) -> list[Any]:
comparable items inside
:return: the same collection ordered in ascending order

Time Complexity:
Best Case: O(n)
Average Case: O(n^2)
Worst Case: O(n^2)

Space Complexity: O(1)

Stable: Yes

Examples:
>>> bubble_sort_iterative([0, 5, 2, 3, 2])
[0, 2, 2, 3, 5]
Expand Down Expand Up @@ -66,6 +75,15 @@ def bubble_sort_recursive(collection: list[Any]) -> list[Any]:
:param collection: mutable ordered sequence of elements
:return: the same list in ascending order

Time Complexity:
Best Case: O(n)
Average Case: O(n^2)
Worst Case: O(n^2)

Space Complexity: O(n)

Stable: Yes

Examples:
>>> bubble_sort_recursive([0, 5, 2, 3, 2])
[0, 2, 2, 3, 5]
Expand Down