Example: stock market

STRINGS AND PATTERN MATCHING - Purdue University

Strings and Pattern Matching 19 The KMP Algorithm (contd.) • the KMP string matching algorithm: Pseudo-Code Algorithm KMPMatch(T,P) Input: Strings T (text) with n characters and P (pattern) with m characters. Output: Starting index of the first substring of T matching P, or an indication that P is not a substring of T.

Tags:

  Matching

Information

Domain:

Source:

Link to this page:

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

Other abuse

Transcription of STRINGS AND PATTERN MATCHING - Purdue University

Related search queries