Skip to content

Improve docstrings in bubble_sort.py to include complexity analysis #14861

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

Open
dhruv-gautam-dev wants to merge 1 commit into
base: master
Choose a base branch
from
+7 −0
Open

Improve docstrings in bubble_sort.py to include complexity analysis #14861

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
7 changes: 7 additions & 0 deletions sorts/bubble_sort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,10 @@
def bubble_sort_iterative(collection: list[Any]) -> list[Any]:
"""Pure implementation of bubble sort algorithm in Python

Time Complexity: O(n^2) - worst and average case
Time Complexity: O(n) - best case (already sorted, early exit via swapped flag)
Space Complexity: O(1) - sorts in place, no extra memory used

:param collection: some mutable ordered collection with heterogeneous
comparable items inside
:return: the same collection ordered in ascending order
Expand Down Expand Up @@ -62,6 +66,9 @@ def bubble_sort_iterative(collection: list[Any]) -> list[Any]:

def bubble_sort_recursive(collection: list[Any]) -> list[Any]:
"""It is similar iterative bubble sort but recursive.
Time Complexity: O(n^2) - worst and average case
Time Complexity: O(n) - best case (already sorted)
Space Complexity: O(n) - recursive call stack uses extra memory

:param collection: mutable ordered sequence of elements
:return: the same list in ascending order
Expand Down