Skip to content

docs: add complexity analysis to bubble_sort docstrings #14823

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
Aditya70-creator wants to merge 2 commits into
base: master
Choose a base branch
from
+15 −1
Open

docs: add complexity analysis to bubble_sort docstrings #14823

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
e5fcd6b
docs: add complexity analysis to bubble_sort docstrings
Aditya70-creator Jun 19, 2026
985a376
Merge branch 'master' into Aditya70-creator-patch-2
Aditya70-creator Jun 19, 2026
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
16 changes: 15 additions & 1 deletion sorts/bubble_sort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,9 +5,16 @@ def bubble_sort_iterative(collection: list[Any]) -> list[Any]:
"""Pure implementation of bubble sort algorithm in Python

:param collection: some mutable ordered collection with heterogeneous
comparable items inside
comparable items inside
:return: the same collection ordered in ascending order

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

Space Complexity: O(1) auxiliary space

Examples:
>>> bubble_sort_iterative([0, 5, 2, 3, 2])
[0, 2, 2, 3, 5]
Expand Down Expand Up @@ -66,6 +73,13 @@ 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:
- Worst Case: O(n^2)
- Average Case: O(n^2)
- Best Case: O(n)

Space Complexity: O(n) auxiliary stack space due to recursion

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