Skip to content
#

boyer-moore-sunday

Star

Here are 3 public repositories matching this topic...

Language: All
Filter by language
All 3 C 1 Java 1 Kotlin 1

darian-catalin-cucer / boyer-moore-algorithm

Star 0

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)

kotlin java html algorithm js math algorithms cpp algorithm-challenges algorithms-datastructures boyer-moore algorithms-and-data-structures boyer-moore-algorithm boyer-moore-horspool boyer-moore-sunday
  • Updated Feb 10, 2023
  • Kotlin

Improve this page

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

Learn more