def ordered_sequential_search(ordered_list, item):
    """Ordered Sequential search
    Complexity:
    item is present: best case=1, worst case=n, avg=n/2
    item not present: best case=1, worst case=n, avg=n/2
    
    Args:
        ordered_list (list): An ordered list.
        item (int): The item to search.
    
    Returns:
        bool: Boolean with the answer of the search.
    
    Examples:
        >>> alist = [0, 1, 2, 8, 13, 17, 19, 32, 42]
        >>> sequential_search(alist, 3)
        False
        >>> sequential_search(alist, 13)
        True
    """
    pos = 0
    found = False
    stop = False
    while pos < len(ordered_list) and not found and not stop:
        if ordered_list[pos] == item:
            found = True
        else:
            if ordered_list[pos] > item:
                stop = True
            else:
                pos += 1
    return found