add generic list type hints to double_linear_search_recursion

[shriya-97]

Describe your change

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
• Documentation change?

Checklist

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Python files are placed inside an existing directory.
• All filenames are in all lowercase characters with no spaces or dashes.
• All functions and variable names follow Python naming conventions.
• All function parameters and return values are annotated with Python type hints.
• All functions have doctests that pass the automated testing.
• All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
• If this pull request resolves one or more open issues, then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".

[cclauss]

Any is not correct in this instance because line 25 uses gt and line 27 uses eq so we need to define a type that is Comparable as discussed at #15490 (review)

You can add a dataclass and doctests to prove this.

from dataclasses import dataclass


@dataclass()
class Person:
    first_name: str

    # __gt__ = None  # if you uncomment either of these lines then the new doctests start to fail.
    # __eq__ = None

### Add to `search()` doctests...

    >>> search([Person("Al"), Person("Bob"), Person("Carl")], Person("Bob"))
    1
    >>> search([Person("Al"), Person("Bob"), Person("Carl")], "Bob")
    -1

You will need to create a Comparable type as discussed in:

• sorts: make algorithms sort any comparable items, not just ints #15234