Content deleted Content added
changed link in intro to point to algorithm subarticle of strings |
EdSchouten (talk | contribs) Don't forget to mention the two-way string-matching algorithm |
||
Line 40:
| Θ(m + k)
| O(mn)
|-
! [[Two-way string-matching algorithm]]
| Θ(m)
| O(n+m)
|}
:1.{{note|Asymptotic times}}Asymptotic times are expressed using [[Big O notation|O, Ω, and Θ notation]].
| |||