SIVERSITY ScIE\CE TECH\OLoGY Brute force算法伪代码2 CHINA Char text[, pat Int n, m int i,], k, lil m lim =n-m+1 for(i=1; i<=lim; 1++) /*search */ for (=l; j<=m & text k==pat[]: j++)k++ if (>m) Report match at position(i-j+1) 021/2 &T2021/2/4 Department of Computer Science & Technology 11 Brute Force算法伪代码2 Char text[], pat[] ; int n, m ; { int i, j, k, lim ; lim = n-m+1 ; for (i=1 ; i <= lim ; i++) /* search */ { k=i ; for (j=1 ; j<=m && text[k]==pat[j]; j++) k++; if (j>m) Report_match_at_position(i-j+1); } }