Revision as of 23:39, 23 September 2022 (view source) Yong (talk \| contribs) (Emacs lisp support good suffix heuristic) ← Older edit		Revision as of 01:11, 11 October 2022 (view source) Wherrera (talk \| contribs) m (remove draft label) Newer edit →
Line 1: {{~~draft~~ task}} ;Task: Line 5: This algorithm is designed for pattern searching on certain types of devices which are backtracking-unfriendly such as [https://en.wikipedia.org/wiki/Tape_drive Tape drives] and [https://en.wikipedia.org/wiki/Hard_disk_drive Hard disks]. ~~Its~~It works by first caching a segment of data from storage and match it against the pattern from the highest position backward to the lowest,. ifIf the matching fails, it will cache next segment of data, and move the start point forward to skip the portion of data which will definitely fail to match,. This continues until we successfully match the pattern or the pointer exceeds the data length. [https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm Follow this link for more information about this algorithm].

Boyer-Moore string search: Difference between revisions

Boyer-Moore string search (view source)