Add insertion sort complexity details

Sushanth012 · Sushanth012 · commit f7da27b4dd03 · 2026-06-27T18:54:06.000-07:00
diff --git a/sorts/insertion_sort.py b/sorts/insertion_sort.py
@@ -31,6 +31,9 @@ def insertion_sort[T: Comparable](collection: MutableSequence[T]) -> MutableSequ
     comparable items inside
     :return: the same collection ordered by ascending
 
+    Time complexity: O(n) in the best case, O(n^2) in the average and worst cases
+    Space complexity: O(1)
+
     Examples:
     >>> insertion_sort([0, 5, 3, 2, 2])
     [0, 2, 2, 3, 5]
