Re: divide & conquer algorithm to implement string matching

The following is an example execution of the program :

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



.