Pattern matching-naïve pattern matching algorithm

a simple pattern matching algorithm ( Brute-force,BF algorithm , brute force algorithm)- replace one and start over again.

Pattern MatchingThe most primitive ideas,from the eye MarkstringTThe first character of theStartand pattern strings Pthe first characterto startthanmore,ifEqual,then continuetheaftercontinuedthe characterintoline ratio more, no theMeshMarkstringTfrom a second characterStartand Pattern StringsPthe first character is re -more, untilPattern StringPeach character in sequence and theMarkstringTin one ofSub-stringEqualto beStop, thiswhencalledto bematch succeeded, notheMatch Lossdefeated.

ifPattern StringPof theLongdegree isM,MeshMarkstringTof theLongdegree isN,AssumptionsThe worst case scenario is that every timemoreare at the end of thenowrange, that is, each pass up tomoreMtimes, up to more thanmoreN-m+1Times,Totalthe ratiomoremost timesto beM (n-m+1), so the naïve pattern-matching algorithmTimeComplexMiscellaneousdegreeto beO (MN). becausea simple pattern matching algorithmof theEfficiencynot high,in theshould actuallyFew in useuse, but easy to understand.

The following is a stepping stone Java implementation.

http://www.oschina.net/code/snippet_660460_48305

Pattern matching-naïve pattern matching algorithm