suppose that the starting position of the N string is found in the M string, and the length is m and n, respectively. Using the KMP algorithm, it is generally believed that the time complexity is O (m), that is, the time complexity of calculating the nex...