"""⏎
This is pure Python implementation of linear search algorithm⏎
⏎
For doctests run following command:⏎
python -m doctest -v linear_search.py⏎
or⏎
python3 -m doctest -v linear_search.py⏎
⏎
For manual testing run:⏎
python linear_search.py⏎
"""⏎
⏎
⏎
def linear_search(sequence, target):⏎
    """Pure implementation of linear search algorithm in Python⏎
⏎
    :param sequence: a collection with comparable items (as sorted items not required in Linear Search)⏎
    :param target: item value to search⏎
    :return: index of found item or None if item is not found⏎
⏎
    Examples:⏎
    >>> linear_search([0, 5, 7, 10, 15], 0)⏎
    0⏎
⏎
    >>> linear_search([0, 5, 7, 10, 15], 15)⏎
    4⏎
⏎
    >>> linear_search([0, 5, 7, 10, 15], 5)⏎
    1⏎
⏎
    >>> linear_search([0, 5, 7, 10, 15], 6)⏎
⏎
    """⏎
    for index, item in enumerate(sequence):⏎
        if item == target:⏎
            return index⏎
    return None⏎
⏎
⏎
if __name__ == "__main__":⏎
    user_input = input("Enter numbers separated by comma:\n").strip()⏎
    sequence = [int(item) for item in user_input.split(",")]⏎
⏎
    target_input = input("Enter a single number to be found in the list:\n")⏎
    target = int(target_input)⏎
    result = linear_search(sequence, target)⏎
    if result is not None:⏎
        print(f"{target} found at position : {result}")⏎
    else:⏎
        print("Not found")⏎