fix: binary search first occurrence and resolve global ruff linting e…

…rrors
TheAlgorithms · tusharynayaka · Mar 3, 2026 · Mar 3, 2026 · Mar 3, 2026 · Mar 3, 2026
commit 4dc8470895154ba334403b9c1749360f9e7b2b3c
diff --git a/searches/jump_search.py b/searches/jump_search.py
@@ -1,3 +1,4 @@
+from typing import Any
 """
 Pure Python implementation of the jump search algorithm.
 This algorithm iterates through a sorted collection with a step of n^(1/2),
@@ -8,9 +9,9 @@
 https://en.wikipedia.org/wiki/Jump_search
 """

 import math
 from collections.abc import Sequence
 from typing import Any, Protocol, TypeVar


 class Comparable(Protocol):
@@ -20,7 +21,7 @@
 T = TypeVar("T", bound=Comparable)
 
 
-def jump_search[T](arr: Sequence[T], item: T) -> int:
+def jump_search(arr: list[Any], x: Any) -> int:
     """
     Python implementation of the jump search algorithm.
     Return the index if the `item` is found, otherwise return -1.
@@ -43,17 +44,17 @@

    prev = 0
    step = block_size
    while arr[min(step, arr_size) - 1] < item:
        prev = step
        step += block_size
        if prev >= arr_size:
            return -1

    while arr[prev] < item:
        prev += 1
        if prev == min(step, arr_size):
            return -1
    if arr[prev] == item:
        return prev
    return -1