Main features

• simplification of the Boyer-Moore algorithm;
• uses only the bad-character shift;
• easy to implement;
• preprocessing phase in O(m+) time and O() space complexity;
• searching phase in O(mn) time complexity;
• very fast in practice for short patterns and large alphabets.