More Pattern Matching Algorithms: B-M

This is the second and final half of our two-part series on pattern matching, or string searching algorithms. In the first part, we covered the Knuth-Morris-Pratt (KMP) algorithm and in this segment, we’re going to present a new algorithm that originates from Boyer-Moore. It is currently considered the most efficient and practical algorithm, serving as a benchmark standard.


Read the full article here: More Pattern Matching Algorithms: B-M

For more discussion go here: Blog Article Discussion