[New Insight] [Polite Mail] Fastest String Search Algorithm.

[New Insight] [Polite Mail] Fastest String Search Algorithm.

[Amit Choudhary]

[-- Attachment #1: Type: text/plain, Size: 901 bytes --]

Hi,

In case people are interested, else please ignore this mail.

I am writing this mail for the sole purpose to prove my point that
hand crafted inputs (haystack, needle) should not be tested.

I read little bit about the twoway method of strstr() and after little
bit of fiddling with the needle, I found out a complex needle for
worst case scenario where strstr() [Latest strstr() from github as
suggested by someone from glibc] takes more time than my algorithm.

So, for some worst case scenarios my algorithm can perform worse and
for some worst case scenarios strstr() can perform worse.

Details can be provided if needed.

The haystack is 65 KB long and needle is 64 bytes long.

I am attaching the bzipped2 file of haystack and needle.

Also, as usual, my algorithm is slower than strstr() for needles less
than or equal to 1 KB.

I am being polite so I expect polite replies if any.

Amit

[-- Attachment #2: haystack_needle.txt.bz2 --]
[-- Type: application/x-bzip, Size: 167 bytes --]