THE COMPARISON OF A SIMPLE SEARCH SUBSTRING ALGORITHM WITH KNUTH-MORRIS-PRATT ALGORITHM WITH EXAMPLES OF IMPLEMENTATION ON C++
Gordenko Maria Konstantinovna
National research university «Higher school of economics»
AbstractTo date, information retrieval is the main task of the computer. Search the specified substring in a string - a simple but important task for today's search engines, programs to work with databases, etc.
There is a considerable amount of analysis algorithms lines, including search algorithms given substring. This article provides two search algorithm substring: Knuth-Morris-Pratt algorithm and simple algorithm and the implementations of them on C++.
Category: 05.00.00 Technical sciences
Article reference:
The comparison of a simple search substring algorithm with Knuth-Morris-Pratt algorithm with examples of implementation on C++ // Modern scientific researches and innovations. 2015. № 2. P. 1 [Electronic journal]. URL: https://web.snauka.ru/en/issues/2015/02/46825
View this article in Russian
Sorry, this article is only available in Русский.
Artice view count:
Please waitAll articles of author «Maria_hse»