String-searching algorithm: Difference between revisions

Revision as of 00:53, 15 January 2016

Revision as of 17:53, 15 January 2016

Line 4:

In practice, how the string is encoded can affect the feasible string search algorithms. In particular if a [[variable width encoding]] is in use then it is slow (time proportional to N) to find the Nth character. This will significantly slow down many of the more advanced search algorithms. A possible solution is to search for the sequence of code units instead, but doing so may produce false matches unless the encoding is specifically designed to avoid it.

Just wanted to add another algorithm. It is only three lines of code and is called a Truth Table search. It should be reasonably quick as buffers aren't flushed and only boolean operations are used. '''<nowiki>http://1drv.ms/1PuVpzS</nowiki>'''

== Basic classification ==