However, as with most advanced string-search algorithms, there tends to be a break-even point in the size of both the haystack and the needle, before which a naive quadratic (memchr-memcmp) implementation is more efficient.