PUBLIC MARKS from parmentierf with tags algorithme & dev

This web-site is the hub of the online game AI community. It includes a leading blog about artificial intelligence in games, a friendly and buzzing forum, as well as a knowledge base in the wiki.

The default sort functions in almost every programming language are poorly suited for human consumption. What do I mean by that?

Our algorithm has the peculiar property that, roughly speaking, the longer the pattern is, the faster the algorithm goes. Furthermore, the algorithm is ``sublinear'' in the sense that it generally looks at fewer characters than it passes. The algorithm is described in

The problem: given a (short) pattern and a (long) text, both strings, determine whether the pattern appears somewhere in the text. Last time we saw how to do this with finite automata. This time we'll go through the Knuth-Morris-Pratt (KMP) algorithm, which can be thought of as an efficient way to build these automata. I also have some working C source code which might help you understand the algorithm better.