Skip to content

improve docstrings in insertion_sort.py to include complexity analysis #14868

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 2 commits into
base: master
Choose a base branch
from
+4 −0
Open

improve docstrings in insertion_sort.py to include complexity analysis #14868

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
dd66eab
improve docstrings in insertion_sort.py to include complexity analysis
dhruv-gautam-dev Jun 27, 2026
768f509
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Jun 27, 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
4 changes: 4 additions & 0 deletions sorts/insertion_sort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -31,6 +31,10 @@ def insertion_sort[T: Comparable](collection: MutableSequence[T]) -> MutableSequ
comparable items inside
:return: the same collection ordered by ascending

Time Complexity: O(n^2) - worst and average case
Time Complexity: O(n) - best case (already sorted, inner while never runs)
Space Complexity: O(1) - sorts in place, no extra memory used

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