Features Time: O(m+n), where m is the length of pattern, and n is the length of input string. Space: O(N), right array holds, if finite number of different chars as pattern. Times of compare: It will take O(m/n) times compares. However, it is normally less than that. You may apply some rules to define a […]