A naive string searching algorithm

naiveStringSearch.py

def search(needle, haystack, end=False):
    """
    A naive string searching function.
    """
    n = len(needle)
    h = len(haystack)

    start = 0
    offset = n

    while offset < h:
        if needle == haystack[start:offset]:
            if end:
                return offset - 1
            else:
                return start
        else:
            start += 1
            offset += 1

    return -1

search('cde', 'abcdabcdefg') # 6
search('cde', 'abcdabcdefg', True) # 8