A regular linear search moves only from left to right, but here two pointers move toward each other. One checks items from the start of the list, while the other checks from the end. Given a list array and a value search_item, return the index where the value is found. If it is not found, return -1.

def double_linear_search(array: list[int], search_item: int) -> int: