Изменения

* partitions the set of pattern positions into two disjoint subsets; the positions in the first set are scanned from left to right and when no mismatch occurs the positions of the second subset are scanned from right to left;* preprocessing phase in Фаза предварительных вычислений занимает <tex>O(m)</tex> time and space complexityвремени и памяти;* searching phase in В худшем случае поиск требует <tex>O(n)</tex> time complexity;сравнений. * performs где <tex>3n</2ntex> {{---}} длина исходного текста, <tex>m</tex> text character comparisons in the worst case.{{---}} длина шаблона