Skip to content
#

boyer-moore

Here are 51 public repositories matching this topic...

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
search-and-sort

Julia and Python search algorithm implementation including Bloom Filter, Aho-Corasick, Boyer-Moore, Knuth-Morris-Pratt, Rabin-Karp, Binary & Sequential; hash algorithm implementation including Fowler-Noll-Vo-1, Jenkins One-at-a-time, Hash Chaining, Linear Probing & Quadratic Probing; sort algorithm implementation including Cocktail, Bitonic, Gno…

  • Updated Jul 21, 2022
  • Julia

Improve this page

Add a description, image, and links to the boyer-moore 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 topic, visit your repo's landing page and select "manage topics."

Learn more