Skip to content
#

boyer-moore-horspool

Here are 22 public repositories matching this topic...

Around 35 of the fastest and most widely used full text search algorithms. Written in c, compiled with llvm.clang for iOS and everything else. Boyer-Moore , Knuth-Morris-Pratt, Reverse Colussi even the Zhu-Takaoka algorithm. And 32 more.

  • Updated Aug 16, 2019
  • Objective-C

The Boyer-Moore algorithm is a string search algorithm that efficiently searches for the occurrence of a pattern in a text. It works by pre-processing the pattern to determine the bad character rule and good suffix rule, which are used to quickly skip over sections of the text that cannot match the pattern. Time complexity of O(n/m)

  • Updated Feb 10, 2023
  • Kotlin

Improve this page

Add a description, image, and links to the boyer-moore-horspool topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the boyer-moore-horspool topic, visit your repo's landing page and select "manage topics."

Learn more