418
правок
Изменения
м
Нет описания правки
==Псевдокод==
==Асимптотики==
* 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>3/2n</tex> text character comparisons in the worst case.
==Сравнение с другими алгоритмами==
===Достоинства===
===Недостатки===
==Ссылки==
* [http://www-igm.univ-mlv.fr/~lecroq/string/node10.html Colussi algorithm]
* [http://alg.csie.ncnu.edu.tw/course/StringMatching/Colussi.ppt Colussi.ppt]
