Definitions from Wiktionary (Boyer-Moore-Horspool algorithm)
▸ noun: (computing theory) An algorithm for finding substrings that trades space for time in order to obtain an average-case time complexity of O(n) on random text.
▸ Words similar to Boyer-Moore-Horspool algorithm
▸ Usage examples for Boyer-Moore-Horspool algorithm
▸ Idioms related to Boyer-Moore-Horspool algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near Boyer-Moore-Horspool algorithm
▸ Rhymes of Boyer-Moore-Horspool algorithm
▸ Invented words related to Boyer-Moore-Horspool algorithm
▸ noun: (computing theory) An algorithm for finding substrings that trades space for time in order to obtain an average-case time complexity of O(n) on random text.
Similar:
string searching algorithm,
pattern matching algorithm,
algorithmic,
checksum,
sorting algorithm,
alchemy,
algorism,
algorithm error,
cipher,
correctness,
more...
▸ Words similar to Boyer-Moore-Horspool algorithm
▸ Usage examples for Boyer-Moore-Horspool algorithm
▸ Idioms related to Boyer-Moore-Horspool algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near Boyer-Moore-Horspool algorithm
▸ Rhymes of Boyer-Moore-Horspool algorithm
▸ Invented words related to Boyer-Moore-Horspool algorithm