[Haskell-beginners] findSubstring deprecated

Daniel Fischer daniel.is.fischer at web.de
Wed Aug 27 10:47:42 EDT 2008


Am Mittwoch, 27. August 2008 13:19 schrieb Rafael Gustavo da Cunha Pereira 
Pinto:
> Thanks!
>
> Either KMP or BM are good for me as I will probably do a (take 1 $ matchSL
> pat list)  on it.
>
> KMP is O(n+m), right?

Yes, and it doesn't have bad constant factors, but take into account the last 
paragraphs of
http://en.wikipedia.org/wiki/Knuth-Morris-Pratt_algorithm
to decide which one to use.
>
> Regards,
> Rafael
Cheers,
Daniel


More information about the Beginners mailing list