Example: confidence
A Fast String Searching Algorithm

A Fast String Searching Algorithm

Back to document page

Knuth, Morris, and Pratt have described a linear search algorithm which preprocesses pat in time linear in patlen and then searches string in time linear in i + patlen. In particular, their algorithm inspects each of the first i + patlen - 1 characters of string precisely once.

  Morris, Cone

Download A Fast String Searching Algorithm


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries