Homework 2 - String matching

For this week, was commissioned a "string matching" with the implementation of the algorithms of Boyer-Moore and Knuth-Morris-Pratt.

Note*: Only apply the Boyer-Moore algorithm and basic algorithm

Operation:

The program runs in a terminal, as the first argument we give the number of letters for the random text in the second argument and give the number of letters for the random pattern.

Code:

Program Running: 

Results:

Now, the simulation is as follows:

Simulation:

....

No Results :(

Note*: Code issues

Repository

• Teoria-de-la-informacion-y-metodos-de-codificacion