Boyer–Moore string-search algorithm
Boyer–Moore string-search algorithm
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
In computer science, the Boyer–Moore string-search algorithm is an efficient string-searching algorithm that is the standard benchmark for practical string-search literature. It was developed by Robert S. Boyer and J Strother Moore in 1977.
Excerpt from the Wikipedia article “Boyer–Moore string-search algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Open free boosters and add Boyer–Moore string-search algorithm to your collection.
Play for free
