If some conditions hold for the string pattern, then in the worst case every string-searching algorithm has to examine all the characters of the text. These conditions hold for more than half of the patterns consisting of 0's and 1's.
- Worst-case behavior
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics