add problem of generic search

Author: codejsha

README.md

@@ -944,6 +944,7 @@ Collections.binarySearch(arrayList, 3);   // for list
 - Find k-th smallest/largest element in an array (`FindKthSmallestElement`/`FindKthLargestElement`), EPI#11.8: [c++](cpp-algorithm/src/search) | Find the k-th smallest/largest element in an array using the quickselect algorithm (`QuickSelectAlgorithm`).
 - Find the minimum and maximum elements in an array (`FindMinMax`), EPI#11.7: [c++](cpp-algorithm/src/search)
 - Search a codon(combinations of three nucleotides) in a gene (`linear_contains`, `binary_contains`), CCSP#2.1: [python](python-algorithm/src/search) | Search a codon(combinations of three nucleotides) in a gene using linear search and binary search.
+- Search an element in generic list (`generic_linear_contains`, `generic_linear_contains`), CCSP#2.1: [python](python-algorithm/src/search) | Search an element in generic list using linear search and binary search.
 - Search a sorted array for entry equal to its index (`SearchEntryEqualToItsIndex`), EPI#11.2: [c++](cpp-algorithm/src/search)
 - Search a sorted array for the first greater than a key (`SearchFirstGreaterThanKey`): [c++](cpp-algorithm/src/search)
 - Search a sorted array for the first occurrence of a key (`SearchFirstOfKey`), EPI#11.1: [c++](cpp-algorithm/src/search)

python-algorithm/algorithm/search/generic_search.py

@@ -0,0 +1,22 @@
+from typing import TypeVar, Iterable, Tuple, List, Sequence
+
+T = TypeVar('T')
+C = TypeVar("C", bound="Comparable")
+
+
+def generic_linear_contains(iterable: Iterable[T], key: T) -> bool:
+    return any(item == key for item in iterable)
+
+
+def generic_binary_contains(sequence: Sequence[C], key: C) -> bool:
+    low: int = 0
+    high: int = len(sequence) - 1
+    while low <= high:
+        mid: int = (low + high) // 2
+        if sequence[mid] < key:
+            low = mid + 1
+        elif sequence[mid] > key:
+            high = mid - 1
+        else:
+            return True
+    return False

python-algorithm/algorithm/search/test_generic_search.py

@@ -0,0 +1,21 @@
+import pytest
+from algorithm.search.generic_search import generic_linear_contains, generic_binary_contains
+
+
+@pytest.mark.benchmark(group="linear_contains")
+@pytest.mark.parametrize("elements, target, expected", [
+    ([1, 5, 15, 15, 15, 15, 20], 5, True),
+], ids=["successful"])
+def test_generic_linear_contains(benchmark, elements, target, expected):
+    result = benchmark(generic_linear_contains, elements, target)
+    assert expected == result
+
+
+@pytest.mark.benchmark(group="binary_contains")
+@pytest.mark.parametrize("elements, target, expected", [
+    (["a", "d", "e", "f", "z"], "f", True),
+    (["john", "mark", "ronald", "sarah"], "sheila", False),
+], ids=["successful", "failed"])
+def test_generic_binary_contains(benchmark, elements, target, expected):
+    result = benchmark(generic_binary_contains, elements, target)
+    assert expected == result