Fixes #14592

searches/double_linear_search_recursion.py

@@ -1,4 +1,4 @@
-def search(list_data: list, key: int, left: int = 0, right: int = 0) -> int:
+def search(list_data: list[int], key: int, left: int = 0, right: int = 0) -> int:
     """
     Iterate through the array to find the index of key using recursion.
     :param list_data: the list to be searched

searches/linear_search.py

@@ -9,7 +9,7 @@
 """
 
 
-def linear_search(sequence: list, target: int) -> int:
+def linear_search(sequence: list[int], target: int) -> int:
     """A pure Python implementation of a linear search algorithm
 
     :param sequence: a collection with comparable items (sorting is not required for
@@ -33,7 +33,7 @@ def linear_search(sequence: list, target: int) -> int:
     return -1
 
 
-def rec_linear_search(sequence: list, low: int, high: int, target: int) -> int:
+def rec_linear_search(sequence: list[int], low: int, high: int, target: int) -> int:
     """
     A pure Python implementation of a recursive linear search algorithm
 

searches/sentinel_linear_search.py

@@ -10,8 +10,10 @@
 python sentinel_linear_search.py
 """
 
+from __future__ import annotations
 
-def sentinel_linear_search(sequence, target):
+
+def sentinel_linear_search(sequence: list[int], target: int) -> int | None:
     """Pure implementation of sentinel linear search algorithm in Python
 
     :param sequence: some sequence with comparable items