TERMIUM Plus^®

Fiche 1,  Justifications,  Anglais

Record number: 1, Textual support number: 1 CONT

At a high level, the KMP algorithm is similar to the naive algorithm: it considers shifts in order from 1 to n−m, and determines if the pattern matches at that shift. The difference is that the KMP algorithm uses information gleaned from partial matches of the pattern and text to skip over shifts that are guaranteed not to result in a match.  1, fiche 1, Anglais, - Knuth%2DMorris%2DPratt%20algorithm

Fiche 1,  Justifications,  Français

Fiche 1,  Justifications,  Espagnol