引用:

---

Applications require two kinds of solution depending on which string, the pattern or the text, is given first. Algorithms based on the use of automata or combinatorial properties of strings are commonly implemented to preprocess the pattern and solve the first kind of problem. The notion of indexes realized by trees or automata is used in the second kind of solutions. This book will only investigate algorithms of the first kind.

---

代码:

---

void BF(char *x, int m, char *y, int n) {
	int i, j;

	/* Searching */
	for (j = 0; j <= n - m; ++j) {
		for (i = 0; i < m && x[i] == y[i + j]; ++i);
			if (i >= m)
			OUTPUT(j);
	/* 
	 * output为自定义函数，j所保存的是一个索引，但是输出的可能是由j计算所得到的某个值
	 * 或者是由j和原来的文本得到的某一个值. -- 我是这样认为的
	 *
	 */
	}
}

---

代码:

---

#define EOS '\0'
   
void BF(char *x, int m, char *y, int n) { 
	char *yb; 

	/* Searching */ 
	for (yb = y; *y != EOS; ++y) 
		if (memcmp(x, y, m) == 0) 
	OUTPUT(y - yb);
}

---