The algorithm is derived from a recursive algorithm that would print all binary numbers that are possible within a selected length characters . The brute force algorithm consists in checking, in the least positions within the text between 0 and n-m, whether an event of the pattern starts there or not. Then, after each attempt, it shifts the pattern by exactly one position to the proper.
You must log in to post a comment.