Skip to content

docs: add complexity analysis to insertion_sort docstring #14939

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
Harman-2 wants to merge 1 commit into
base: master
Choose a base branch
from
+10 −0
Open

docs: add complexity analysis to insertion_sort docstring #14939

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
10 changes: 10 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,16 @@ def insertion_sort[T: Comparable](collection: MutableSequence[T]) -> MutableSequ
comparable items inside
:return: the same collection ordered by ascending

Complexity Analysis:
Time Complexity:
- Best Case: O(n) when the collection is already sorted
- Average Case: O(n^2)
- Worst Case: O(n^2) when the collection is sorted in reverse order

Space Complexity:
- O(1) because the algorithm sorts the collection in place and
uses only a constant amount of additional memory

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