New string search algorithm
From the site:<p>>Preprocessing phase in O(M) space and time complexity. Searching phase average O(N) time complexity and O(N*M) worst case complexity.<p>I don't trust the analysis of someone referring to "average O(N) time"; Big O notation refers to boundary times.<p>Edit: Okay, based on arguments here and on [1], I'm going to accept that maybe he's just bastardizing the notation.<p>[1] <a href="http://stackoverflow.com/questions/3905355/meaning-of-average-complexity-when-using-big-o-notation" rel="nofollow">http://stackoverflow.com/questions/3905355/meaning-of-averag...</a>