| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
Document the performance characteristics of insertion sort in the function docstring: - Time Complexity: O(n^2) worst/average case, O(n) best case (already sorted input) - Space Complexity: O(1), sorts in place Fixes TheAlgorithms#14866
| Back | FazBrowse Home | New Git URL |
Describe your change:
Adds the performance characteristics of insertion sort to the insertion_sort() docstring in sorts/insertion_sort.py, as requested in the issue:
Documentation-only change; no code logic modified. All existing doctests pass.
Fixes #14866