String Maching Algorithm

kamrul · Post by **kamrul** » Mon Dec 29, 2003 9:32 am

Can anyone tell me which one is the Best String maching algorithm ??

Tahseen Mohammad · Post by **Tahseen Mohammad** » Mon Dec 29, 2003 10:35 am

Among the algorithm I know, KMP is the fastest.

I don't understand it completely but I think its not hard to code.
Look in Coreman's chapter on "String Matching".

Tahseen Mohammad · Post by **Tahseen Mohammad** » Mon Dec 29, 2003 10:37 am

I forgot about the Boyer-Moore algorithm.

Its the asymptotically the fastest. It uses some heuristic functions.
But KMP is best in the worst case.

Both of them are in the same chapter of Coremen. Choose what
best suits your need.