Use Any from typing to resolve mypy list unpacking bugs

Author: ale-molinari

sorts/tim_sort.py

@@ -1,9 +1,6 @@
-def binary_search[T: (int, float, str)](
-    lst: list[T],
-    item: T,
-    start: int,
-    end: int,
-) -> int:
+from typing import Any
+
+def binary_search(lst: list[Any], item: Any, start: int, end: int) -> int:
     if start == end:
         return start if lst[start] > item else start + 1
     if start > end:
@@ -18,7 +15,7 @@ def binary_search[T: (int, float, str)](
         return mid
 
 
-def insertion_sort[T: (int, float, str)](lst: list[T]) -> list[T]:
+def insertion_sort(lst: list[Any]) -> list[Any]:
     length = len(lst)
 
     for index in range(1, length):
@@ -29,7 +26,7 @@ def insertion_sort[T: (int, float, str)](lst: list[T]) -> list[T]:
     return lst
 
 
-def merge[T: (int, float, str)](left: list[T], right: list[T]) -> list[T]:
+def merge(left: list[Any], right: list[Any]) -> list[Any]:
     if not left:
         return right
 
@@ -42,9 +39,7 @@ def merge[T: (int, float, str)](left: list[T], right: list[T]) -> list[T]:
     return [right[0], *merge(left, right[1:])]
 
 
-def tim_sort[T: (int, float, str)](
-    lst: list[T] | tuple[T, ...] | str,
-) -> list[T] | list[str]:
+def tim_sort(lst: list[Any] | tuple[Any, ...] | str) -> list[Any]:
     """
     >>> tim_sort("Python")
     ['P', 'h', 'n', 'o', 't', 'y']
@@ -60,7 +55,7 @@ def tim_sort[T: (int, float, str)](
     length = len(lst)
     runs, sorted_runs = [], []
     new_run = [lst[0]]
-    sorted_array: list[T] = []
+    sorted_array: list[Any] = []
     i = 1
     while i < length:
         if lst[i] < lst[i - 1]: