jueves, 21 de febrero de 2013


For this homework we had to implement two algorithms for matching strings. These are Boyer-Moore algorithm and Knuth-Morris-Pratt algorithm. You can find a good and brief explanation along with C pseudocode of Boyer-Moore here, and here for Knuth-Morris-Prat.

Here's my implementation of the Boyer algorithm . It is unfinished.

You can run it by passing the TEXT and the PATTERN as arguments to the command prompt, it tells you if there is a match:

1 comentario: