Skip to content

Add insertion sort complexity details#14869

Closed
Sushanth012 wants to merge 1 commit into
TheAlgorithms:masterfrom
Sushanth012:docs/insertion-sort-complexity
Closed

Add insertion sort complexity details#14869
Sushanth012 wants to merge 1 commit into
TheAlgorithms:masterfrom
Sushanth012:docs/insertion-sort-complexity

Conversation

@Sushanth012

Copy link
Copy Markdown

Summary

  • Add best, average, and worst case time complexity to the insertion_sort docstring
  • Add constant auxiliary space complexity to the same docstring

Closes #14866

Tests

  • py -3.14 -m doctest -v sorts\insertion_sort.py
  • uvx ruff@0.15.15 check sorts\insertion_sort.py
  • uvx ruff@0.15.15 format --check sorts\insertion_sort.py

@algorithms-keeper

Copy link
Copy Markdown

Closing this pull request as invalid

@Sushanth012, this pull request is being closed as none of the checkboxes have been marked. It is important that you go through the checklist and mark the ones relevant to this pull request. Please read the Contributing guidelines.

If you're facing any problem on how to mark a checkbox, please read the following instructions:

  • Read a point one at a time and think if it is relevant to the pull request or not.
  • If it is, then mark it by putting a x between the square bracket like so: [x]

NOTE: Only [x] is supported so if you have put any other letter or symbol between the brackets, that will be marked as invalid. If that is the case then please open a new pull request with the appropriate changes.

@algorithms-keeper algorithms-keeper Bot added the awaiting reviews This PR is ready to be reviewed label Jun 28, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

awaiting reviews This PR is ready to be reviewed invalid

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Improve docstrings in insertion_sort.py to include complexity analysis

1 participant