In the brute force pattern matching algorithm when all the characters in the pattern are unique then brute force can be implemented in Big-oh(n) complexity where n is the length of the string (reference: introduction to algorithms). can anyone help me with the algorithm? Thanks in advance
saimadanmohan 0 Newbie Poster
Recommended Answers
Jump to PostWalk over the source once. Keep a reference to the first match and as long as the source matches the pattern, walk over the pattern too. If the pattern reaches the end of the string, you have a complete match. Otherwise, reset the pattern and start over.
All 3 Replies
deceptikon 1,790 Code Sniper Team Colleague Featured Poster
Walk over the source once. Keep a reference to the first match and as long as the source matches the pattern, walk over the pattern too. If the pattern reaches the end of the string, you have a complete match. Otherwise, reset the pattern and start over.
Ancient Dragon 5,243 Achieved Level 70 Team Colleague Featured Poster
If the pattern is allowed to use wild card characters, such as * and ? then it gets a bit trickier.
stevedaniel 0 Newbie Poster
card characters gets a bit trickier.
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.