Example: bankruptcy
STRINGS AND PATTERN MATCHING - Purdue University

STRINGS AND PATTERN MATCHING - Purdue University

Back to document page

Brute Force • TheBrute Force algorithm compares the pattern to the text, one character at a time, until unmatching characters are found: - Compared characters are italicized. - Correct matches are in boldface type. • The algorithm can be designed to stop on either the first occurrence of the pattern, or upon reaching the end of the text.

  Force, Brute, Brute force

Download STRINGS AND PATTERN MATCHING - Purdue University


Information

Domain:

Source:

Link to this page:

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

Other abuse

Advertisement

Related search queries