Strings 2008 2 3: Difference between revisions
From MDWiki
Jump to navigationJump to search
ThomasHuber (talk | contribs) No edit summary |
ThomasHuber (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
== Brute force (naive) search == | == Brute force (naive) search == | ||
The simplest, but also least efficient approach to text searching is to check | The simplest, but also least efficient approach to text searching is to check whether the pattern matches the string at every possible position in the string. This is called the brute-force or naive string search algorithm. The procedure is illustrated below. | ||
[[Image:Image:Brute force schema.png|naive string search algorithm]] | |||
--[[User:ThomasHuber|ThomasHuber]] 13:03, 10 January 2008 (EST) | |||
Revision as of 02:03, 10 January 2008
Brute force (naive) search
The simplest, but also least efficient approach to text searching is to check whether the pattern matches the string at every possible position in the string. This is called the brute-force or naive string search algorithm. The procedure is illustrated below.
--ThomasHuber 13:03, 10 January 2008 (EST)
