Jump to content

Talk:String-searching algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 213.39.140.196 (talk) at 23:50, 15 October 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Moved from article

These descriptions are insufficient!

Could somebody expand this entry ?

The "Finite Automata" link is entirely unhelpful, redirection to a page about finite state machines that has no information on string searching. --Furrykef 05:53, 29 Jun 2004 (UTC)

Nasty encodings

Some mention should be made of nasty character encodings that require special precautions when searching.......... Plugwash 11:35, 21 March 2006 (UTC)[reply]

Matching times

Are the matching times listed in the comparison table factual at all? I see most of them have been marked as Θ(n). Is it just a stub? References? --Bisqwit 11:46, 26 May 2006 (UTC) Also, Θ() notation is used incorrectly, e.g. naive string searching is O(nm) -- when the two strings are the same, running time is Θ(n).[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:String-searching_algorithm&oldid=81685138"