问题4：你能否说说naive.算法有什么问 题，为什么有可能改进？ a a b a a a a b S=0 S=3 a a b a a b NAIVE-STRING-MATCHER(T,P) 逐位单字符比较 1 n T.length The naive string-matcher is 2 m P.length inefficient because it entirely 3 fors 0to n-m ignores information gained if P[1..m ==Ts +1..s+m about the text for one value print“Pattern occurs with shift”s of s when it considers other values of s.The naive string-matcher is inefficient because it entirely ignores information gained about the text for one value of s when it considers other values of s