Revision as of 10:21, 20 June 2016 edit EdSchouten (talk \| contribs) 44 edits Don't forget to mention the two-way string-matching algorithm ← Previous edit		Revision as of 10:36, 10 August 2016 edit undo 2a02:8071:328a:b600:e47f:5b03:bddb:89b1 (talk) →Single pattern algorithms: boyer moore strictly has a runtime of O(nm), could be looked up if clicking on the link Next edit →
Line 35: ! [[Boyer–Moore string search algorithm]] \| Θ(m + k) \| best Ω(n/m),<br/>worst O(nmn) \|- ! [[Bitap algorithm]] (''shift-or'', ''shift-and'', ''Baeza–Yates–Gonnet'')

String-searching algorithm: Difference between revisions