Revision as of 14:17, 10 December 2015 edit Jouravla (talk \| contribs) 3 edits Altering some phrasing; Reorganization of sections; Addition of Related Concepts and uses of Trees in Presorting; Correction of Horspool's runtime ← Previous edit		Revision as of 17:05, 16 December 2015 edit undo 64.8.14.254 (talk) Wording edit Next edit →
Line 41: == String Matching == [[String matching]] ~~can be~~is a complex issue in the world of [[Computer programming\|programming]]~~. String matching is becoming a huge frontier~~ now that [[Web search engine\|search engines]] are the forefront of the internet and the online world. When given a keyword or a string that needs to be searched among millions upon millions of words, it would take an unbelievable amount of time to match this string character per character. Input enhancement allows an input to be altered to make this process that much faster. The [[brute-force search\|brute-force]] algorithm for this problem would perform as follows:

Input enhancement (computer science): Difference between revisions