Boyer–Moore–Horspool algorithm
id:
boyer-moore-horspool-algorithm-169-4100347
title:
Boyer–Moore–Horspool algorithm
text:
In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings. It was published by Nigel Horspool in 1980 as SBM. It is a simplification of the Boyer–Moore string-search algorithm which is related to the Knuth–Morris–Pratt algorithm. The algorithm trades space for time in order to obtain an average-case complexity of O(n) on random text, although it has O(nm) in the worst case, where the length of the pattern is m and the length
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm
date created:
2005-04-17T13:02:32Z
date modified:
2024-08-31T08:25:40Z
main entity:
{"identifier":"Q4060665","url":"https://www.wikidata.org/entity/Q4060665"}
image:
fields total:
13
integrity:
14