Boyer-Moore Substring Search - Part 1
🎁 FREE Algorithms Interview Questions Course - https://bit.ly/3s37wON
🎁 FREE Machine Learning Course - https://bit.ly/3oY4aLi
🎁 FREE Python Programming Course - https://bit.ly/3JJMHOD
📱 FREE Algorithms Visualization App - http://bit.ly/algorhyme-app
This lecture is about substring search and the famous Boyer-More substring search algorithm! We can find a given pattern in O(N+M) running time (on average). Unfortunately in worst-case scenario it runs in O(NM) time which is not that favorable.
There are better substring search approaches such as KMP algorithm or the state-of-the-art Z substring search algorithm!
✅ Facebook: / globalsoftwarealgorithms
✅ Instagram: / global.software.algorithms