串匹配算法概述(续)8 VERSITI E\CE TECH\OLOGY CHINA 口 From left to right Karp and rabin Knuth, Morris and Pratt 口 From right to left Boyer and moore H orspoo In any order Brute Force Algorithms( Naive Algorithm 021/2 &T2021/2/4 Department of Computer Science & Technology 8 串匹配算法概述 (续)  From left to right ➢ Karp and Rabin ➢ Knuth，Morris and Pratt  From right to left ➢ Boyer and Moore ➢ Horspool  In any order ➢ Brute Force Algorithms（ Naive Algorithm ）