Boyer-Moore Search

Boyer-Moore search algorithms.

Boyer-Moore algorithms for searching a text for a single substring.
These modules use a reverse (right->left), pattern scan with two predefined shift functions resulting in an average sub-linear performance:  O(text-length/pattern-length).
______________________

MAKEFILE
BM.H
BM.C
BM.TST
______________________

Tuned Boyer-Moore search algorithm.

Tuned Boyer-Moore (BM) algorithm for fast string searching.
These modules implement a compact, portable and fast BM algorithm, ie. an unrolled variant of search forward for rightmost char in the pattern.

______________________

MAKEFILE
TBM.H
TBM.C
______________________

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: