Page 1 of 1
String Maching Algorithm
Posted: Mon Dec 29, 2003 9:32 am
by kamrul
Can anyone tell me which one is the Best String maching algorithm ??
Posted: Mon Dec 29, 2003 10:35 am
by Tahseen Mohammad
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".
Posted: Mon Dec 29, 2003 10:37 am
by Tahseen Mohammad
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.