Strings 2008 2 3: Difference between revisions
From MDWiki
Jump to navigationJump to search
ThomasHuber (talk | contribs) No edit summary |
(No difference)
|
Revision as of 01:39, 10 January 2008
Brute force (naive) search
The simplest, but also least efficient approach to text searching is to check is the try out every possible combination in which the two strings can be
Formalisation of the problem
Given a (short) string p (dubbed pattern) and a