Raita algorithm

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In computer science, the Raita algorithm is a string searching algorithm which improves the performance of Boyer–Moore–Horspool algorithm. This algorithm preprocesses the string being searched for the pattern, which is similar to Boyer–Moore string-search algorithm. The searching pattern of particular sub-string in a given string is different from Boyer–Moore–Horspool algorithm. This algorithm was published by Timo Raita in 19911.

In computer science, the Raita algorithm is a string searching algorithm which improves the performance of Boyer–Moore–Horspool algorithm. This algorithm preprocesses the string being searched for the pattern, which is similar to Boyer–Moore string-search algorithm. The searching pattern of particular sub-string in a given string is different from Boyer–Moore–Horspool algorithm. This algorithm was published by Timo Raita in 1991. include include define ALPHABET_SIZE (1 n) return; if (lpat == 1) { char *match_ptr = s; while (match_ptr

External links

Applet animation and Description for Raita Algorithm

Text derived from https://en.wikipedia.org/w/index.php?oldid=1157291016 under CC BY-SA 4.0; modifications have been made.

References

  1. ↩Wikipedia “Raita algorithm” revision 1157291016 · retrieved 2026-10-20 publication date (×1) · confidence 0.95 revision URL