strstr() vs Knuth Morris Pratt

Question

有人可以帮我了解哪个是更有效的strstr（）或KMP吗？最近我在SPOJ上进行了一个问题，发现strstr（）的速度或某种方式比KMP快。 。

Answer 1

You are comparing apples with pears, strstr() is a function to find substrings, KMP is an algorithm to do it, so strstr() could theoretically be implemented using KMP. You need to find out which algorithm is the strstr() in question implementing to give a statement.

Take a look at this answer and the comments on it.