Find a seq in a list

find_seq.py

def find_seq(seq, alist):
    '''
    Find the sequence @seq in the list @alist.

    @seq: a list or tuple with size `m`.
    @alist: a list or tuple with size `n`.
    @return: True if @alist contains @seq, False otherwise.

    Complexity: `O((n-m) * m) = O(n * m)`
    '''
    for index, item in enumerate(alist): # O(n)
        sublist = alist[index:index+len(seq)]
        if len(sublist) < len(seq):
            break
        if seq == sublist: # O(m)
            return True
    return False

# Tests
assert find_seq([], [1, 3, 4]) == True
assert find_seq([4], [1, 3, 4]) == True
assert find_seq([6, 7], [1, 3, 4, 5, 6, 7]) == True
assert find_seq([1, 3, 4], [1, 3, 4]) == True
assert find_seq([1, 3, 4], [1, 3, 4, 5]) == True
assert find_seq([1, 3, 4], [0, 1, 3, 4]) == True
assert find_seq([1, 3, 4], [5, 1, 3, 4, 6]) == True
assert find_seq([1, 2, 3, 4], [1, 2, 3, 5, 1, 2, 3, 6, 1, 2, 3, 7, 1, 2, 3, 4]) == True

assert find_seq([1, 3, 4], []) == False
assert find_seq([1, 3, 4], [1, 3]) == False
assert find_seq([1, 3, 4], [1, 3, 5]) == False
assert find_seq([1, 3, 4], [5, 1, 3, 6, 4]) == False