string matching algorithm with linear time

Question

1.00/5 (1 vote)

See more:

the best algoritm for string matching with linear time is kmp but i dont know about f please explain this algorim

Posted 11-Oct-13 22:11pm

1 solution

Add a Solution

Treat my content as plain text, not as HTML

…

Sign in to your account

Download, Vote, Comment, Publish.

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Andreas Gieriet · Answer 1 · 2013-10-11T22:19:00

Com'on: how about asking google, e.g. "kmp string compare".
E.g. see http://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm[^].
Cheers
Andi

Posted 11-Oct-13 22:19pm