Re: divide & conquer algorithm to implement string matching

On 30 Mag, 15:17, CBFalconer <cbfalco...@xxxxxxxxx> wrote:
Brilliantly opaque. This message has virtually zero chance of
being understood anywhere, lacking any quotation.
This is a new execution example.I hope this is less opaque.
In the next execution example the only think where you may have any
prolem(if you don't look at the code) is the various numbers that you
can see between [].Those are simply the array indexes where those
sequences begin,and they are useful to see which one is missing.

string : 01101011000110101100
pattern to search : 0110
sequence[0] = 0110
sequence[3] = 0101
sequence[6] = 1100
sequence[9] = 0011
sequence[12] = 1010
sequence[15] = 0110
sequence[1] = 1101
sequence[4] = 1011
sequence[7] = 1000
sequence[10] = 0110
sequence[13] = 0101
sequence[16] = 1100
sequence[2] = 1010
sequence[5] = 0110
sequence[8] = 0001
sequence[11] = 1101
sequence[14] = 1011
number of sequences found = 4

To change the output I added 2 printf lines in the main(),so I do not
repost the code for such a trivial change.

--------------------------------------------

.

Relevant Pages

  • "Run-Time Check Failure #2" on Xerces & Xalan (Bug?)
    ... that the sequences of "cc*" are modified for the variable "theEvaluator" ... This change is done when the declaration of "XPathEvaluator ... after the execution, and some detailed explanations. ... Memory dump just when it's declared: ...
    (comp.lang.cpp)
  • "Run-Time Check Failure #2" on Xerces & Xalan (Bug?)
    ... that the sequences of "cc*" are modified for the variable "theEvaluator" ... This change is done when the declaration of "XPathEvaluator ... after the execution, and some detailed explanations. ... Memory dump just when it's declared: ...
    (microsoft.public.dotnet.languages.vc)
  • Le Grand Chef
    ... A highly enjoyable movie with a quite effective emotional core. ... pieces are in place and the execution is quite well done. ... sequences could have been abit more in depth and felt like IRON CHEF ...
    (rec.arts.movies.current-films)
  • Re: divide & conquer algorithm to implement string matching
    ... The following is an example execution of the program: ... number of sequences found = 4 ... Brilliantly opaque. ...
    (comp.programming)
  • Re: divide & conquer algorithm to implement string matching
    ... The following is an example execution of the program: ... number of sequences found = 4 ... Brilliantly opaque. ...
    (comp.programming)