July 2018
Beginner
202 pages
5h 4m
English
String matching algorithms are quite common in text-editing programs. These kind of programs frequently need to find all occurrences of a pattern in the text, where the text is usually the document being edited and the pattern is a word supplied by the user. Since text-editing programs aim to be responsive, having efficient algorithms to solve the string matching problem is fundamental.
By the end of this chapter, you will be able to:
Read now
Unlock full access