Better Algorithms?

Better Algorithms?

• The Simple Algorithm is Q(nm) where n and m are the lengths of the two strings
• The Simple Algorithm Searches places that are “Proven to be bad”
• Complete fore-knowledge of the pattern string is assumed

Previous slide

Next slide

Back to the first slide

View Graphic Version