GitHub / darian-catalin-cucer / boyer-moore-algorithm
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)
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darian-catalin-cucer%2Fboyer-moore-algorithm
PURL: pkg:github/darian-catalin-cucer/boyer-moore-algorithm
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: Kotlin
Size: 1.95 KB
Dependencies parsed at: Pending
Created at: over 2 years ago
Updated at: over 2 years ago
Pushed at: over 2 years ago
Last synced at: about 2 years ago
Topics: algorithm, algorithm-challenges, algorithms, algorithms-and-data-structures, algorithms-datastructures, boyer-moore, boyer-moore-algorithm, boyer-moore-horspool, boyer-moore-sunday, cpp, html, java, js, kotlin, math