Description: The preparation of the three procedures, respectively, of KMP, the Monte Carlo and Las Vegas algorithm randomly generated no less than 5000 pairs,
Length is very long, and a length ranging from 01-string X and Y (three procedures to generate
The same string), then statistical algorithm execution time, error rate of the Monte Carlo method, and the operating results of the three algorithms in-depth comparison. Note that
To this question below to the prime numbers to achieve the above algorithm, the completion of prime numbers to determine
The algorithmic programming algorithm after a certain number of large prime numbers and save them with an array of (respectively, test no more than 5000,500000,50000000), for the above randomized algorithm
To Search:
File list (Check if you may need any files):
pattern_matching.cpp