---
title: Raita algorithm
slug: raita-algorithm
qid: 
snapshot: enwiki-001157291016
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1157291016
tags: [22970550, 24043274, 25397562, 25397606, 26748027, 30181014]
---

# Raita algorithm

> [!note] Provenance
> Snapshot `enwiki-001157291016` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1157291016> · Licensed CC BY-SA 4.0

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.

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
