Eric Blake said:
> Should POSIX require linear (rather than quadratic) worst-case performance
> in strstr? Or maybe we just leave this improvement as a
> quality-of-implementation issue, but perhaps document in the application
> notes document that many implementations use less-than-stellar algori
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
A recent bug report[1] against glibc complains that its current
implementation of strstr is O(m*n), with m the length of the needle, n the
length of the haystack (the report is actually against the
analagous, but non-standardized, memmem, but the issu
