Repository navigation
Improve docstrings in insertion_sort.py to include complexity analysis #14866
Description
What would you like to share?
The insertion_sort() function in sorts/insertion_sort.py is missing
time and space complexity information in its docstring.
Proposed addition:
- Time Complexity: O(n^2) - worst and average case
- Time Complexity: O(n) - best case (already sorted)
- Space Complexity: O(1) - sorts in place
This helps students and developers understand the performance
characteristics of the algorithm.
Additional information
No response
Activity
sanchiagarwal0 commentedon Aug 17, 2026
Hi! I would like to work on improving the insertion_sort.py docstrings by adding the complexity analysis described in this issue. I will keep the change focused on documentation. Please let me know if this is okay.