ABOUT THE OPERATION PRINCIPLE OF NAIVE, KMP AND BM ALGORITHMS IN TEXT ANALYSIS

Аннотация

ABSTRACT The article deals with Naive, Knuth-Morris-Pratt and Boyer-Moore algorithms. The history of these algorithms, the idea of ​​operation, is explained with diagrams and tables. Its program in python language is created and the main part of the codes is presented and analyzed based on the table. The principles of determining the effectiveness of algorithms are explained through a table. Understanding the concept of how algorithms work increases your ability to think logically and solve problems, and in turn builds the ability to easily explain commands to a computer. Keywords: Algorithms, Data structure, String, Pattern, Big O, Naïve, Knut - Morris - Pratt(KMP), Boyer-Moore(BM), String matching, Glossary of Computer Terms